TSTP Solution File: LCL077-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 12:06:42 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL077-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 11:15:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.40 % SZS status Unsatisfiable
% 0.13/0.40 % SZS output begin IncompleteProof
% 0.13/0.40 cnf(c0, axiom,
% 0.13/0.40 ~is_a_theorem(implies(not(not(a)),a))).
% 0.13/0.40 cnf(c1, plain,
% 0.13/0.40 ~is_a_theorem(implies(not(not(a)),a)),
% 0.13/0.40 inference(start, [], [c0])).
% 0.13/0.40
% 0.13/0.40 cnf(c2, axiom,
% 0.13/0.40 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 0.13/0.40 cnf(a0, assumption,
% 0.13/0.40 implies(not(not(a)),a) = X0).
% 0.13/0.40 cnf(c3, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.40 cnf(c4, plain,
% 0.13/0.40 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.40
% 0.13/0.40 cnf(c5, axiom,
% 0.13/0.40 is_a_theorem(implies(X2,implies(X3,X2)))).
% 0.13/0.40 cnf(a1, assumption,
% 0.13/0.40 X1 = implies(X2,implies(X3,X2))).
% 0.13/0.40 cnf(c6, plain,
% 0.13/0.40 ~is_a_theorem(implies(X1,X0)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.40 cnf(c7, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.40
% 0.13/0.40 cnf(c8, axiom,
% 0.13/0.40 is_a_theorem(X4) | ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4))).
% 0.13/0.40 cnf(a2, assumption,
% 0.13/0.40 implies(X1,X0) = X4).
% 0.13/0.40 cnf(c9, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.40 cnf(c10, plain,
% 0.13/0.40 ~is_a_theorem(X5) | ~is_a_theorem(implies(X5,X4)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.40
% 0.13/0.40 cnf(c11, axiom,
% 0.13/0.40 is_a_theorem(implies(X6,X7)) | ~is_a_theorem(implies(X8,X7)) | ~is_a_theorem(implies(X6,X8))).
% 0.13/0.40 cnf(a3, assumption,
% 0.13/0.40 X5 = implies(X6,X7)).
% 0.13/0.40 cnf(c12, plain,
% 0.13/0.40 ~is_a_theorem(implies(X5,X4)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.40 cnf(c13, plain,
% 0.13/0.40 ~is_a_theorem(implies(X8,X7)) | ~is_a_theorem(implies(X6,X8)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.40
% 0.13/0.40 cnf(c14, axiom,
% 0.13/0.40 is_a_theorem(implies(X9,X10)) | ~is_a_theorem(implies(X11,X10)) | ~is_a_theorem(implies(X9,X11))).
% 0.13/0.40 cnf(a4, assumption,
% 0.13/0.40 implies(X8,X7) = implies(X9,X10)).
% 0.13/0.40 cnf(c15, plain,
% 0.13/0.40 ~is_a_theorem(implies(X6,X8)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.13/0.40 cnf(c16, plain,
% 0.13/0.40 ~is_a_theorem(implies(X11,X10)) | ~is_a_theorem(implies(X9,X11)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.13/0.40
% 0.13/0.40 cnf(c17, axiom,
% 0.13/0.40 is_a_theorem(implies(implies(not(X12),not(X13)),implies(X13,X12)))).
% 0.13/0.40 cnf(a5, assumption,
% 0.13/0.40 implies(X11,X10) = implies(implies(not(X12),not(X13)),implies(X13,X12))).
% 0.13/0.40 cnf(c18, plain,
% 0.13/0.40 ~is_a_theorem(implies(X9,X11)),
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.13/0.40 cnf(c19, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 0.13/0.40
% 0.13/0.40 cnf(c20, axiom,
% 0.13/0.40 is_a_theorem(implies(implies(not(X14),not(X15)),implies(X15,X14)))).
% 0.13/0.40 cnf(a6, assumption,
% 0.13/0.40 implies(X9,X11) = implies(implies(not(X14),not(X15)),implies(X15,X14))).
% 0.13/0.40 cnf(c21, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 0.13/0.40 cnf(c22, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a6])], [c18, c20])).
% 0.13/0.40
% 0.13/0.40 cnf(c23, axiom,
% 0.13/0.40 is_a_theorem(implies(X16,implies(X17,X16)))).
% 0.13/0.40 cnf(a7, assumption,
% 0.13/0.40 implies(X6,X8) = implies(X16,implies(X17,X16))).
% 0.13/0.40 cnf(c24, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c15, c23])).
% 0.13/0.40 cnf(c25, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a7])], [c15, c23])).
% 0.13/0.40
% 0.13/0.40 cnf(c26, axiom,
% 0.13/0.40 is_a_theorem(implies(implies(X18,implies(X19,X20)),implies(implies(X18,X19),implies(X18,X20))))).
% 0.13/0.40 cnf(a8, assumption,
% 0.13/0.40 implies(X5,X4) = implies(implies(X18,implies(X19,X20)),implies(implies(X18,X19),implies(X18,X20)))).
% 0.13/0.40 cnf(c27, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])).
% 0.13/0.40 cnf(c28, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])).
% 0.13/0.40
% 0.13/0.40 cnf(c29, plain,
% 0.13/0.40 $false,
% 0.13/0.40 inference(constraint_solving, [
% 0.13/0.40 bind(X0, implies(not(not(a)),a)),
% 0.13/0.40 bind(X1, implies(X2,implies(X3,X2))),
% 0.13/0.40 bind(X2, not(X15)),
% 0.13/0.40 bind(X3, X3),
% 0.13/0.40 bind(X4, implies(X1,X0)),
% 0.13/0.40 bind(X5, implies(X6,X7)),
% 0.13/0.40 bind(X6, not(X15)),
% 0.13/0.40 bind(X7, implies(X13,X12)),
% 0.13/0.40 bind(X8, implies(not(X14),not(X15))),
% 0.13/0.40 bind(X9, implies(not(X14),not(X15))),
% 0.13/0.40 bind(X10, implies(X13,X12)),
% 0.13/0.40 bind(X11, implies(not(X12),not(X13))),
% 0.13/0.40 bind(X12, a),
% 0.13/0.40 bind(X13, implies(X3,X2)),
% 0.13/0.40 bind(X14, not(X13)),
% 0.13/0.40 bind(X15, not(X12)),
% 0.13/0.40 bind(X16, not(X15)),
% 0.13/0.40 bind(X17, not(X14)),
% 0.13/0.40 bind(X18, not(X15)),
% 0.13/0.40 bind(X19, implies(X3,X2)),
% 0.13/0.40 bind(X20, a)
% 0.13/0.40 ],
% 0.13/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.13/0.40
% 0.13/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------