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