TSTP Solution File: LCL459+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL459+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 : n017.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:20 EDT 2022
% Result : Theorem 0.09s 0.30s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : LCL459+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.10 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.29 % Computer : n017.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sat Jul 2 16:03:55 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.09/0.30 % SZS status Theorem
% 0.09/0.30 % SZS output begin IncompleteProof
% 0.09/0.30 cnf(c0, axiom,
% 0.09/0.30 ~kn1).
% 0.09/0.30 cnf(c1, plain,
% 0.09/0.30 ~kn1,
% 0.09/0.30 inference(start, [], [c0])).
% 0.09/0.30
% 0.09/0.30 cnf(c2, axiom,
% 0.09/0.30 kn1 | ~is_a_theorem(implies(sK32,and(sK32,sK32)))).
% 0.09/0.30 cnf(c3, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c1, c2])).
% 0.09/0.30 cnf(c4, plain,
% 0.09/0.30 ~is_a_theorem(implies(sK32,and(sK32,sK32))),
% 0.09/0.30 inference(strict_predicate_extension, [], [c1, c2])).
% 0.09/0.30
% 0.09/0.30 cnf(c5, axiom,
% 0.09/0.30 is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens).
% 0.09/0.30 cnf(a0, assumption,
% 0.09/0.30 implies(sK32,and(sK32,sK32)) = X0).
% 0.09/0.30 cnf(c6, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.09/0.30 cnf(c7, plain,
% 0.09/0.30 ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens,
% 0.09/0.30 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.09/0.30
% 0.09/0.30 cnf(c8, axiom,
% 0.09/0.30 is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))) | ~implies_2).
% 0.09/0.30 cnf(a1, assumption,
% 0.09/0.30 implies(X1,X0) = implies(implies(X2,implies(X2,X3)),implies(X2,X3))).
% 0.09/0.30 cnf(c9, plain,
% 0.09/0.30 ~is_a_theorem(X1) | ~modus_ponens,
% 0.09/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 0.09/0.30 cnf(c10, plain,
% 0.09/0.30 ~implies_2,
% 0.09/0.30 inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 0.09/0.30
% 0.09/0.30 cnf(c11, axiom,
% 0.09/0.30 implies_2).
% 0.09/0.30 cnf(c12, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c10, c11])).
% 0.09/0.30 cnf(c13, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c10, c11])).
% 0.09/0.30
% 0.09/0.30 cnf(c14, axiom,
% 0.09/0.30 is_a_theorem(implies(X4,implies(X5,and(X4,X5)))) | ~and_3).
% 0.09/0.30 cnf(a2, assumption,
% 0.09/0.30 X1 = implies(X4,implies(X5,and(X4,X5)))).
% 0.09/0.30 cnf(c15, plain,
% 0.09/0.30 ~modus_ponens,
% 0.09/0.30 inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])).
% 0.09/0.30 cnf(c16, plain,
% 0.09/0.30 ~and_3,
% 0.09/0.30 inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])).
% 0.09/0.30
% 0.09/0.30 cnf(c17, axiom,
% 0.09/0.30 and_3).
% 0.09/0.30 cnf(c18, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c16, c17])).
% 0.09/0.30 cnf(c19, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c16, c17])).
% 0.09/0.30
% 0.09/0.30 cnf(c20, axiom,
% 0.09/0.30 modus_ponens).
% 0.09/0.30 cnf(c21, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c15, c20])).
% 0.09/0.30 cnf(c22, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(strict_predicate_extension, [], [c15, c20])).
% 0.09/0.30
% 0.09/0.30 cnf(c23, plain,
% 0.09/0.30 $false,
% 0.09/0.30 inference(constraint_solving, [
% 0.09/0.30 bind(X0, implies(sK32,and(sK32,sK32))),
% 0.09/0.30 bind(X1, implies(X2,implies(X2,X3))),
% 0.09/0.30 bind(X2, sK32),
% 0.09/0.30 bind(X3, and(sK32,sK32)),
% 0.09/0.30 bind(X4, sK32),
% 0.09/0.30 bind(X5, sK32)
% 0.09/0.30 ],
% 0.09/0.30 [a0, a1, a2])).
% 0.09/0.30
% 0.09/0.30 % SZS output end IncompleteProof
%------------------------------------------------------------------------------