TSTP Solution File: LCL469+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL469+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 : 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:09:25 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL469+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.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 02:20:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.40 % SZS status Theorem
% 0.21/0.40 % SZS output begin IncompleteProof
% 0.21/0.40 cnf(c0, axiom,
% 0.21/0.40 ~or_1).
% 0.21/0.40 cnf(c1, plain,
% 0.21/0.40 ~or_1,
% 0.21/0.40 inference(start, [], [c0])).
% 0.21/0.40
% 0.21/0.40 cnf(c2, axiom,
% 0.21/0.40 or_1 | ~is_a_theorem(implies(sK19,or(sK19,sK20)))).
% 0.21/0.40 cnf(c3, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c1, c2])).
% 0.21/0.40 cnf(c4, plain,
% 0.21/0.40 ~is_a_theorem(implies(sK19,or(sK19,sK20))),
% 0.21/0.40 inference(strict_predicate_extension, [], [c1, c2])).
% 0.21/0.40
% 0.21/0.40 cnf(c5, axiom,
% 0.21/0.40 or(X0,X1) = not(and(not(X0),not(X1))) | ~op_or).
% 0.21/0.40 cnf(a0, assumption,
% 0.21/0.40 or(sK19,sK20) = or(X0,X1)).
% 0.21/0.40 cnf(c6, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.21/0.40 cnf(c7, plain,
% 0.21/0.40 ~op_or,
% 0.21/0.40 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.21/0.40 cnf(c8, plain,
% 0.21/0.40 X2 != not(and(not(X0),not(X1))) | ~is_a_theorem(implies(sK19,X2)),
% 0.21/0.40 inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.21/0.40
% 0.21/0.40 cnf(c9, axiom,
% 0.21/0.40 implies(X3,X4) = not(and(X3,not(X4))) | ~op_implies_and).
% 0.21/0.40 cnf(a1, assumption,
% 0.21/0.40 not(and(not(X0),not(X1))) = not(and(X3,not(X4)))).
% 0.21/0.40 cnf(c10, plain,
% 0.21/0.40 ~is_a_theorem(implies(sK19,X2)),
% 0.21/0.40 inference(strict_function_extension, [assumptions([a1])], [c8, c9])).
% 0.21/0.40 cnf(c11, plain,
% 0.21/0.40 ~op_implies_and,
% 0.21/0.40 inference(strict_function_extension, [assumptions([a1])], [c8, c9])).
% 0.21/0.40 cnf(c12, plain,
% 0.21/0.40 X5 != implies(X3,X4) | X2 != X5,
% 0.21/0.40 inference(strict_function_extension, [assumptions([a1])], [c8, c9])).
% 0.21/0.40
% 0.21/0.40 cnf(a2, assumption,
% 0.21/0.40 X5 = implies(X3,X4)).
% 0.21/0.40 cnf(c13, plain,
% 0.21/0.40 X2 != X5,
% 0.21/0.40 inference(reflexivity, [assumptions([a2])], [c12])).
% 0.21/0.40
% 0.21/0.40 cnf(a3, assumption,
% 0.21/0.40 X2 = X5).
% 0.21/0.40 cnf(c14, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(reflexivity, [assumptions([a3])], [c13])).
% 0.21/0.40
% 0.21/0.40 cnf(c15, axiom,
% 0.21/0.40 op_implies_and).
% 0.21/0.40 cnf(c16, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c11, c15])).
% 0.21/0.40 cnf(c17, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c11, c15])).
% 0.21/0.40
% 0.21/0.40 cnf(c18, axiom,
% 0.21/0.40 is_a_theorem(implies(X6,implies(not(X6),X7))) | ~cn2).
% 0.21/0.40 cnf(a4, assumption,
% 0.21/0.40 implies(sK19,X2) = implies(X6,implies(not(X6),X7))).
% 0.21/0.40 cnf(c19, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c10, c18])).
% 0.21/0.40 cnf(c20, plain,
% 0.21/0.40 ~cn2,
% 0.21/0.40 inference(strict_predicate_extension, [assumptions([a4])], [c10, c18])).
% 0.21/0.40
% 0.21/0.40 cnf(c21, axiom,
% 0.21/0.40 cn2).
% 0.21/0.40 cnf(c22, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c20, c21])).
% 0.21/0.40 cnf(c23, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c20, c21])).
% 0.21/0.40
% 0.21/0.40 cnf(c24, axiom,
% 0.21/0.40 op_or).
% 0.21/0.40 cnf(c25, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c7, c24])).
% 0.21/0.40 cnf(c26, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(strict_predicate_extension, [], [c7, c24])).
% 0.21/0.40
% 0.21/0.40 cnf(c27, plain,
% 0.21/0.40 $false,
% 0.21/0.40 inference(constraint_solving, [
% 0.21/0.40 bind(X0, sK19),
% 0.21/0.40 bind(X1, sK20),
% 0.21/0.40 bind(X2, implies(X3,X4)),
% 0.21/0.40 bind(X3, not(X0)),
% 0.21/0.40 bind(X4, sK20),
% 0.21/0.40 bind(X5, implies(X3,X4)),
% 0.21/0.40 bind(X6, sK19),
% 0.21/0.40 bind(X7, sK20)
% 0.21/0.40 ],
% 0.21/0.40 [a0, a1, a2, a3, a4])).
% 0.21/0.40
% 0.21/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------