TSTP Solution File: LCL454+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL454+1 : TPTP v8.1.0. Released v3.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 : n003.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:09:18 EDT 2022
% Result : Theorem 64.54s 8.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL454+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 06:06:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 64.54/8.55 % SZS status Theorem
% 64.54/8.55 % SZS output begin IncompleteProof
% 64.54/8.55 cnf(c0, axiom,
% 64.54/8.55 ~r1).
% 64.54/8.55 cnf(c1, plain,
% 64.54/8.55 ~r1,
% 64.54/8.55 inference(start, [], [c0])).
% 64.54/8.55
% 64.54/8.55 cnf(c2, axiom,
% 64.54/8.55 r1 | ~is_a_theorem(implies(or(sK44,sK44),sK44))).
% 64.54/8.55 cnf(c3, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c1, c2])).
% 64.54/8.55 cnf(c4, plain,
% 64.54/8.55 ~is_a_theorem(implies(or(sK44,sK44),sK44)),
% 64.54/8.55 inference(strict_predicate_extension, [], [c1, c2])).
% 64.54/8.55
% 64.54/8.55 cnf(c5, axiom,
% 64.54/8.55 is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens).
% 64.54/8.55 cnf(a0, assumption,
% 64.54/8.55 implies(or(sK44,sK44),sK44) = X0).
% 64.54/8.55 cnf(c6, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 64.54/8.55 cnf(c7, plain,
% 64.54/8.55 ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 64.54/8.55
% 64.54/8.55 cnf(c8, axiom,
% 64.54/8.55 is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))) | ~implies_2).
% 64.54/8.55 cnf(a1, assumption,
% 64.54/8.55 implies(X1,X0) = implies(implies(X2,implies(X2,X3)),implies(X2,X3))).
% 64.54/8.55 cnf(c9, plain,
% 64.54/8.55 ~is_a_theorem(X1) | ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 64.54/8.55 cnf(c10, plain,
% 64.54/8.55 ~implies_2,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 64.54/8.55
% 64.54/8.55 cnf(c11, axiom,
% 64.54/8.55 implies_2).
% 64.54/8.55 cnf(c12, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c10, c11])).
% 64.54/8.55 cnf(c13, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c10, c11])).
% 64.54/8.55
% 64.54/8.55 cnf(c14, axiom,
% 64.54/8.55 is_a_theorem(X4) | ~is_a_theorem(implies(X5,X4)) | ~is_a_theorem(X5) | ~modus_ponens).
% 64.54/8.55 cnf(a2, assumption,
% 64.54/8.55 X1 = X4).
% 64.54/8.55 cnf(c15, plain,
% 64.54/8.55 ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])).
% 64.54/8.55 cnf(c16, plain,
% 64.54/8.55 ~is_a_theorem(implies(X5,X4)) | ~is_a_theorem(X5) | ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])).
% 64.54/8.55
% 64.54/8.55 cnf(c17, axiom,
% 64.54/8.55 is_a_theorem(X6) | ~is_a_theorem(implies(X7,X6)) | ~is_a_theorem(X7) | ~modus_ponens).
% 64.54/8.55 cnf(a3, assumption,
% 64.54/8.55 implies(X5,X4) = X6).
% 64.54/8.55 cnf(c18, plain,
% 64.54/8.55 ~is_a_theorem(X5) | ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a3])], [c16, c17])).
% 64.54/8.55 cnf(c19, plain,
% 64.54/8.55 ~is_a_theorem(implies(X7,X6)) | ~is_a_theorem(X7) | ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a3])], [c16, c17])).
% 64.54/8.55
% 64.54/8.55 cnf(c20, axiom,
% 64.54/8.55 is_a_theorem(implies(implies(X8,X9),implies(implies(X10,X9),implies(or(X8,X10),X9)))) | ~or_3).
% 64.54/8.55 cnf(a4, assumption,
% 64.54/8.55 implies(X7,X6) = implies(implies(X8,X9),implies(implies(X10,X9),implies(or(X8,X10),X9)))).
% 64.54/8.55 cnf(c21, plain,
% 64.54/8.55 ~is_a_theorem(X7) | ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a4])], [c19, c20])).
% 64.54/8.55 cnf(c22, plain,
% 64.54/8.55 ~or_3,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a4])], [c19, c20])).
% 64.54/8.55
% 64.54/8.55 cnf(c23, axiom,
% 64.54/8.55 or_3).
% 64.54/8.55 cnf(c24, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c22, c23])).
% 64.54/8.55 cnf(c25, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c22, c23])).
% 64.54/8.55
% 64.54/8.55 cnf(c26, axiom,
% 64.54/8.55 is_a_theorem(implies(X11,implies(X12,X11))) | ~implies_1).
% 64.54/8.55 cnf(a5, assumption,
% 64.54/8.55 X7 = implies(X11,implies(X12,X11))).
% 64.54/8.55 cnf(c27, plain,
% 64.54/8.55 ~modus_ponens,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a5])], [c21, c26])).
% 64.54/8.55 cnf(c28, plain,
% 64.54/8.55 ~implies_1,
% 64.54/8.55 inference(strict_predicate_extension, [assumptions([a5])], [c21, c26])).
% 64.54/8.55
% 64.54/8.55 cnf(c29, axiom,
% 64.54/8.55 implies_1).
% 64.54/8.55 cnf(c30, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c28, c29])).
% 64.54/8.55 cnf(c31, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c28, c29])).
% 64.54/8.55
% 64.54/8.55 cnf(c32, axiom,
% 64.54/8.55 modus_ponens).
% 64.54/8.55 cnf(c33, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c27, c32])).
% 64.54/8.55 cnf(c34, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(strict_predicate_extension, [], [c27, c32])).
% 64.54/8.55
% 64.54/8.55 cnf(c35, plain,
% 64.54/8.55 is_a_theorem(X7)).
% 64.54/8.55 cnf(a6, assumption,
% 64.54/8.55 X5 = X7).
% 64.54/8.55 cnf(c36, plain,
% 64.54/8.55 ~modus_ponens,
% 64.54/8.55 inference(predicate_reduction, [assumptions([a6])], [c18, c35])).
% 64.54/8.55
% 64.54/8.55 cnf(c37, plain,
% 64.54/8.55 modus_ponens).
% 64.54/8.55 cnf(c38, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(predicate_reduction, [], [c36, c37])).
% 64.54/8.55
% 64.54/8.55 cnf(c39, plain,
% 64.54/8.55 modus_ponens).
% 64.54/8.55 cnf(c40, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(predicate_reduction, [], [c15, c39])).
% 64.54/8.55
% 64.54/8.55 cnf(c41, plain,
% 64.54/8.55 $false,
% 64.54/8.55 inference(constraint_solving, [
% 64.54/8.55 bind(X0, implies(or(sK44,sK44),sK44)),
% 64.54/8.55 bind(X1, implies(X2,implies(X2,X3))),
% 64.54/8.55 bind(X2, or(sK44,sK44)),
% 64.54/8.55 bind(X3, sK44),
% 64.54/8.55 bind(X4, implies(X2,implies(X2,X3))),
% 64.54/8.55 bind(X5, implies(X10,X9)),
% 64.54/8.55 bind(X6, implies(X5,X4)),
% 64.54/8.55 bind(X7, implies(X8,X9)),
% 64.54/8.55 bind(X8, sK44),
% 64.54/8.55 bind(X9, implies(X2,X3)),
% 64.54/8.55 bind(X10, sK44),
% 64.54/8.55 bind(X11, sK44),
% 64.54/8.55 bind(X12, or(sK44,sK44))
% 64.54/8.55 ],
% 64.54/8.55 [a0, a1, a2, a3, a4, a5, a6])).
% 64.54/8.55
% 64.54/8.55 % SZS output end IncompleteProof
%------------------------------------------------------------------------------