TSTP Solution File: LCL686+1.001 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL686+1.001 : TPTP v8.1.0. Released v4.0.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:11:18 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL686+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n017.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 23:37:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output begin IncompleteProof
% 0.19/0.43 cnf(c0, axiom,
% 0.19/0.43 sP3(X0) | ~r1(sK8,X0)).
% 0.19/0.43 cnf(c1, plain,
% 0.19/0.43 sP3(X0) | ~r1(sK8,X0),
% 0.19/0.43 inference(start, [], [c0])).
% 0.19/0.43
% 0.19/0.43 cnf(c2, axiom,
% 0.19/0.43 sP0(X1) | ~sP3(X1)).
% 0.19/0.43 cnf(a0, assumption,
% 0.19/0.43 X0 = X1).
% 0.19/0.43 cnf(c3, plain,
% 0.19/0.43 ~r1(sK8,X0),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.43 cnf(c4, plain,
% 0.19/0.43 sP0(X1),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.43
% 0.19/0.43 cnf(c5, axiom,
% 0.19/0.43 r1(X2,sK6(X2)) | ~sP0(X2)).
% 0.19/0.43 cnf(a1, assumption,
% 0.19/0.43 X1 = X2).
% 0.19/0.43 cnf(c6, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.19/0.43 cnf(c7, plain,
% 0.19/0.43 r1(X2,sK6(X2)),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.19/0.43
% 0.19/0.43 cnf(c8, axiom,
% 0.19/0.43 p1(X3) | ~p2(X3) | ~r1(X4,X3) | ~sP1(X4)).
% 0.19/0.43 cnf(a2, assumption,
% 0.19/0.43 X2 = X4).
% 0.19/0.43 cnf(a3, assumption,
% 0.19/0.43 sK6(X2) = X3).
% 0.19/0.43 cnf(c9, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.19/0.43 cnf(c10, plain,
% 0.19/0.43 p1(X3) | ~p2(X3) | ~sP1(X4),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.19/0.43
% 0.19/0.43 cnf(c11, axiom,
% 0.19/0.43 ~p1(X5) | p2(X5) | ~r1(X6,X5) | ~sP1(X6)).
% 0.19/0.43 cnf(a4, assumption,
% 0.19/0.43 X3 = X5).
% 0.19/0.43 cnf(c12, plain,
% 0.19/0.43 ~p2(X3) | ~sP1(X4),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.43 cnf(c13, plain,
% 0.19/0.43 p2(X5) | ~r1(X6,X5) | ~sP1(X6),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.43
% 0.19/0.43 cnf(c14, axiom,
% 0.19/0.43 ~p1(sK6(X7)) | ~p2(sK6(X7)) | ~sP0(X7)).
% 0.19/0.43 cnf(a5, assumption,
% 0.19/0.43 X5 = sK6(X7)).
% 0.19/0.43 cnf(c15, plain,
% 0.19/0.43 ~r1(X6,X5) | ~sP1(X6),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.19/0.43 cnf(c16, plain,
% 0.19/0.43 ~p1(sK6(X7)) | ~sP0(X7),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.19/0.43
% 0.19/0.43 cnf(c17, plain,
% 0.19/0.43 p1(X3)).
% 0.19/0.43 cnf(a6, assumption,
% 0.19/0.43 sK6(X7) = X3).
% 0.19/0.43 cnf(c18, plain,
% 0.19/0.43 ~sP0(X7),
% 0.19/0.43 inference(predicate_reduction, [assumptions([a6])], [c16, c17])).
% 0.19/0.43
% 0.19/0.43 cnf(c19, plain,
% 0.19/0.43 sP0(X1)).
% 0.19/0.43 cnf(a7, assumption,
% 0.19/0.43 X7 = X1).
% 0.19/0.43 cnf(c20, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(predicate_reduction, [assumptions([a7])], [c18, c19])).
% 0.19/0.43
% 0.19/0.43 cnf(c21, plain,
% 0.19/0.43 r1(X2,sK6(X2))).
% 0.19/0.43 cnf(a8, assumption,
% 0.19/0.43 X6 = X2).
% 0.19/0.43 cnf(a9, assumption,
% 0.19/0.43 X5 = sK6(X2)).
% 0.19/0.43 cnf(c22, plain,
% 0.19/0.43 ~sP1(X6),
% 0.19/0.43 inference(predicate_reduction, [assumptions([a8, a9])], [c15, c21])).
% 0.19/0.43
% 0.19/0.43 cnf(c23, axiom,
% 0.19/0.43 sP1(X8) | ~sP3(X8)).
% 0.19/0.43 cnf(a10, assumption,
% 0.19/0.43 X6 = X8).
% 0.19/0.43 cnf(c24, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a10])], [c22, c23])).
% 0.19/0.43 cnf(c25, plain,
% 0.19/0.43 ~sP3(X8),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a10])], [c22, c23])).
% 0.19/0.43
% 0.19/0.43 cnf(c26, plain,
% 0.19/0.43 sP3(X0)).
% 0.19/0.43 cnf(a11, assumption,
% 0.19/0.43 X8 = X0).
% 0.19/0.43 cnf(c27, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(predicate_reduction, [assumptions([a11])], [c25, c26])).
% 0.19/0.43
% 0.19/0.43 cnf(c28, axiom,
% 0.19/0.43 p2(sK6(X9)) | p1(sK6(X9)) | ~sP0(X9)).
% 0.19/0.43 cnf(a12, assumption,
% 0.19/0.43 X3 = sK6(X9)).
% 0.19/0.43 cnf(c29, plain,
% 0.19/0.43 ~sP1(X4),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a12])], [c12, c28])).
% 0.19/0.43 cnf(c30, plain,
% 0.19/0.43 p1(sK6(X9)) | ~sP0(X9),
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a12])], [c12, c28])).
% 0.19/0.43
% 0.19/0.43 cnf(c31, plain,
% 0.19/0.43 ~p1(X3)).
% 0.19/0.43 cnf(a13, assumption,
% 0.19/0.43 sK6(X9) = X3).
% 0.19/0.43 cnf(c32, plain,
% 0.19/0.43 ~sP0(X9),
% 0.19/0.43 inference(predicate_reduction, [assumptions([a13])], [c30, c31])).
% 0.19/0.43
% 0.19/0.43 cnf(c33, plain,
% 0.19/0.43 sP0(X1)).
% 0.19/0.43 cnf(a14, assumption,
% 0.19/0.43 X9 = X1).
% 0.19/0.43 cnf(c34, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(predicate_reduction, [assumptions([a14])], [c32, c33])).
% 0.19/0.43
% 0.19/0.43 cnf(c35, plain,
% 0.19/0.43 sP1(X6)).
% 0.19/0.43 cnf(a15, assumption,
% 0.19/0.43 X4 = X6).
% 0.19/0.43 cnf(c36, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(predicate_reduction, [assumptions([a15])], [c29, c35])).
% 0.19/0.43
% 0.19/0.43 cnf(c37, axiom,
% 0.19/0.43 r1(X10,X10)).
% 0.19/0.43 cnf(a16, assumption,
% 0.19/0.43 sK8 = X10).
% 0.19/0.43 cnf(a17, assumption,
% 0.19/0.43 X0 = X10).
% 0.19/0.43 cnf(c38, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])).
% 0.19/0.43 cnf(c39, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])).
% 0.19/0.43
% 0.19/0.43 cnf(c40, plain,
% 0.19/0.43 $false,
% 0.19/0.43 inference(constraint_solving, [
% 0.19/0.43 bind(X0, sK8),
% 0.19/0.43 bind(X1, sK8),
% 0.19/0.43 bind(X2, sK8),
% 0.19/0.43 bind(X3, sK6(X2)),
% 0.19/0.43 bind(X4, sK8),
% 0.19/0.43 bind(X5, sK6(X2)),
% 0.19/0.43 bind(X6, sK8),
% 0.19/0.43 bind(X7, sK8),
% 0.19/0.43 bind(X8, sK8),
% 0.19/0.43 bind(X9, sK8),
% 0.19/0.43 bind(X10, sK8)
% 0.19/0.43 ],
% 0.19/0.43 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.19/0.43
% 0.19/0.43 % SZS output end IncompleteProof
%------------------------------------------------------------------------------