TSTP Solution File: LCL361-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL361-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n012.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:08:41 EDT 2022
% Result : Unsatisfiable 0.10s 0.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL361-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.11 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.10/0.32 % Computer : n012.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Sun Jul 3 19:14:46 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % SZS status Unsatisfiable
% 0.10/0.33 % SZS output begin IncompleteProof
% 0.10/0.33 cnf(c0, axiom,
% 0.10/0.33 ~is_a_theorem(implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x))))).
% 0.10/0.33 cnf(c1, plain,
% 0.10/0.33 ~is_a_theorem(implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x)))),
% 0.10/0.33 inference(start, [], [c0])).
% 0.10/0.33
% 0.10/0.33 cnf(c2, axiom,
% 0.10/0.33 is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 0.10/0.33 cnf(a0, assumption,
% 0.10/0.33 implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x))) = X0).
% 0.10/0.33 cnf(c3, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.10/0.33 cnf(c4, plain,
% 0.10/0.33 ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.10/0.33
% 0.10/0.33 cnf(c5, axiom,
% 0.10/0.33 is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2))).
% 0.10/0.33 cnf(a1, assumption,
% 0.10/0.33 X1 = X2).
% 0.10/0.33 cnf(c6, plain,
% 0.10/0.33 ~is_a_theorem(implies(X1,X0)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.10/0.33 cnf(c7, plain,
% 0.10/0.33 ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.10/0.33
% 0.10/0.33 cnf(c8, axiom,
% 0.10/0.33 is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6))))).
% 0.10/0.33 cnf(a2, assumption,
% 0.10/0.33 X3 = implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))).
% 0.10/0.33 cnf(c9, plain,
% 0.10/0.33 ~is_a_theorem(implies(X3,X2)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.10/0.33 cnf(c10, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 0.10/0.33
% 0.10/0.33 cnf(c11, axiom,
% 0.10/0.33 is_a_theorem(X7) | ~is_a_theorem(X8) | ~is_a_theorem(implies(X8,X7))).
% 0.10/0.33 cnf(a3, assumption,
% 0.10/0.33 implies(X3,X2) = X7).
% 0.10/0.33 cnf(c12, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 0.10/0.33 cnf(c13, plain,
% 0.10/0.33 ~is_a_theorem(X8) | ~is_a_theorem(implies(X8,X7)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 0.10/0.33
% 0.10/0.33 cnf(c14, axiom,
% 0.10/0.33 is_a_theorem(implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11))))).
% 0.10/0.33 cnf(a4, assumption,
% 0.10/0.33 X8 = implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11)))).
% 0.10/0.33 cnf(c15, plain,
% 0.10/0.33 ~is_a_theorem(implies(X8,X7)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.10/0.33 cnf(c16, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.10/0.33
% 0.10/0.33 cnf(c17, axiom,
% 0.10/0.33 is_a_theorem(implies(implies(X12,X13),implies(implies(X13,X14),implies(X12,X14))))).
% 0.10/0.33 cnf(a5, assumption,
% 0.10/0.33 implies(X8,X7) = implies(implies(X12,X13),implies(implies(X13,X14),implies(X12,X14)))).
% 0.10/0.33 cnf(c18, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.10/0.33 cnf(c19, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.10/0.33
% 0.10/0.33 cnf(c20, axiom,
% 0.10/0.33 is_a_theorem(X15) | ~is_a_theorem(X16) | ~is_a_theorem(implies(X16,X15))).
% 0.10/0.33 cnf(a6, assumption,
% 0.10/0.33 implies(X1,X0) = X15).
% 0.10/0.33 cnf(c21, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a6])], [c6, c20])).
% 0.10/0.33 cnf(c22, plain,
% 0.10/0.33 ~is_a_theorem(X16) | ~is_a_theorem(implies(X16,X15)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a6])], [c6, c20])).
% 0.10/0.33
% 0.10/0.33 cnf(c23, axiom,
% 0.10/0.33 is_a_theorem(implies(X17,implies(not(X17),X18)))).
% 0.10/0.33 cnf(a7, assumption,
% 0.10/0.33 X16 = implies(X17,implies(not(X17),X18))).
% 0.10/0.33 cnf(c24, plain,
% 0.10/0.33 ~is_a_theorem(implies(X16,X15)),
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 0.10/0.33 cnf(c25, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a7])], [c22, c23])).
% 0.10/0.33
% 0.10/0.33 cnf(c26, axiom,
% 0.10/0.33 is_a_theorem(implies(implies(X19,X20),implies(implies(X20,X21),implies(X19,X21))))).
% 0.10/0.33 cnf(a8, assumption,
% 0.10/0.33 implies(X16,X15) = implies(implies(X19,X20),implies(implies(X20,X21),implies(X19,X21)))).
% 0.10/0.33 cnf(c27, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a8])], [c24, c26])).
% 0.10/0.33 cnf(c28, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(strict_predicate_extension, [assumptions([a8])], [c24, c26])).
% 0.10/0.33
% 0.10/0.33 cnf(c29, plain,
% 0.10/0.33 $false,
% 0.10/0.33 inference(constraint_solving, [
% 0.10/0.33 bind(X0, implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x)))),
% 0.10/0.33 bind(X1, implies(X12,X14)),
% 0.10/0.33 bind(X2, implies(X12,X14)),
% 0.10/0.33 bind(X3, implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))),
% 0.10/0.33 bind(X4, implies(X10,X11)),
% 0.10/0.33 bind(X5, implies(X9,X11)),
% 0.10/0.33 bind(X6, x),
% 0.10/0.33 bind(X7, implies(X3,X2)),
% 0.10/0.33 bind(X8, implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11)))),
% 0.10/0.33 bind(X9, not(X17)),
% 0.10/0.33 bind(X10, y),
% 0.10/0.33 bind(X11, x),
% 0.10/0.33 bind(X12, implies(X9,X10)),
% 0.10/0.33 bind(X13, implies(implies(X10,X11),implies(X9,X11))),
% 0.10/0.33 bind(X14, implies(implies(X5,X6),implies(X4,X6))),
% 0.10/0.33 bind(X15, implies(X1,X0)),
% 0.10/0.33 bind(X16, implies(X17,implies(not(X17),X18))),
% 0.10/0.33 bind(X17, x),
% 0.10/0.33 bind(X18, y),
% 0.10/0.33 bind(X19, x),
% 0.10/0.33 bind(X20, implies(not(X17),X18)),
% 0.10/0.33 bind(X21, implies(implies(X5,X6),implies(X4,X6)))
% 0.10/0.33 ],
% 0.10/0.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.10/0.33
% 0.10/0.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------