TSTP Solution File: LCL638+1.001 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL638+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 : n004.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:10:11 EDT 2022
% Result : Theorem 11.14s 1.97s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 3 09:40:08 EDT 2022
% 0.14/0.36 % CPUTime :
% 11.14/1.97 % SZS status Theorem
% 11.14/1.97 % SZS output begin IncompleteProof
% 11.14/1.97 cnf(c0, axiom,
% 11.14/1.97 r1(sK2,sK3)).
% 11.14/1.97 cnf(c1, plain,
% 11.14/1.97 r1(sK2,sK3),
% 11.14/1.97 inference(start, [], [c0])).
% 11.14/1.97
% 11.14/1.97 cnf(c2, axiom,
% 11.14/1.97 r1(X0,sK4(X0)) | ~r1(sK2,X0)).
% 11.14/1.97 cnf(a0, assumption,
% 11.14/1.97 sK2 = sK2).
% 11.14/1.97 cnf(a1, assumption,
% 11.14/1.97 sK3 = X0).
% 11.14/1.97 cnf(c3, plain,
% 11.14/1.97 $false,
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 11.14/1.97 cnf(c4, plain,
% 11.14/1.97 r1(X0,sK4(X0)),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 11.14/1.97
% 11.14/1.97 cnf(c5, axiom,
% 11.14/1.97 p1(X1) | ~p1(sK8(X2)) | ~r1(X1,X2) | ~r1(sK2,X1)).
% 11.14/1.97 cnf(a2, assumption,
% 11.14/1.97 X0 = X1).
% 11.14/1.97 cnf(a3, assumption,
% 11.14/1.97 sK4(X0) = X2).
% 11.14/1.97 cnf(c6, plain,
% 11.14/1.97 $false,
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 11.14/1.97 cnf(c7, plain,
% 11.14/1.97 p1(X1) | ~p1(sK8(X2)) | ~r1(sK2,X1),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 11.14/1.97
% 11.14/1.97 cnf(c8, axiom,
% 11.14/1.97 ~p1(sK3)).
% 11.14/1.97 cnf(a4, assumption,
% 11.14/1.97 X1 = sK3).
% 11.14/1.97 cnf(c9, plain,
% 11.14/1.97 ~p1(sK8(X2)) | ~r1(sK2,X1),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 11.14/1.97 cnf(c10, plain,
% 11.14/1.97 $false,
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a4])], [c7, c8])).
% 11.14/1.97
% 11.14/1.97 cnf(c11, axiom,
% 11.14/1.97 r1(X3,sK5(X3)) | p1(X4) | ~r1(X5,X4) | ~r1(X3,X5) | ~r1(sK2,X3)).
% 11.14/1.97 cnf(a5, assumption,
% 11.14/1.97 sK8(X2) = X4).
% 11.14/1.97 cnf(c12, plain,
% 11.14/1.97 ~r1(sK2,X1),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a5])], [c9, c11])).
% 11.14/1.97 cnf(c13, plain,
% 11.14/1.97 r1(X3,sK5(X3)) | ~r1(X5,X4) | ~r1(X3,X5) | ~r1(sK2,X3),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a5])], [c9, c11])).
% 11.14/1.97
% 11.14/1.97 cnf(c14, axiom,
% 11.14/1.97 p1(X6) | ~r1(sK3,X6)).
% 11.14/1.97 cnf(a6, assumption,
% 11.14/1.97 X3 = sK3).
% 11.14/1.97 cnf(a7, assumption,
% 11.14/1.97 sK5(X3) = X6).
% 11.14/1.97 cnf(c15, plain,
% 11.14/1.97 ~r1(X5,X4) | ~r1(X3,X5) | ~r1(sK2,X3),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 11.14/1.97 cnf(c16, plain,
% 11.14/1.97 p1(X6),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 11.14/1.97
% 11.14/1.97 cnf(c17, axiom,
% 11.14/1.97 ~p1(sK5(X7)) | p1(X8) | ~r1(X9,X8) | ~r1(X7,X9) | ~r1(sK2,X7)).
% 11.14/1.97 cnf(a8, assumption,
% 11.14/1.97 X6 = sK5(X7)).
% 11.14/1.97 cnf(c18, plain,
% 11.14/1.97 $false,
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a8])], [c16, c17])).
% 11.14/1.97 cnf(c19, plain,
% 11.14/1.97 p1(X8) | ~r1(X9,X8) | ~r1(X7,X9) | ~r1(sK2,X7),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a8])], [c16, c17])).
% 11.14/1.97
% 11.14/1.97 cnf(c20, plain,
% 11.14/1.97 ~p1(sK8(X2))).
% 11.14/1.97 cnf(a9, assumption,
% 11.14/1.97 X8 = sK8(X2)).
% 11.14/1.97 cnf(c21, plain,
% 11.14/1.97 ~r1(X9,X8) | ~r1(X7,X9) | ~r1(sK2,X7),
% 11.14/1.97 inference(predicate_reduction, [assumptions([a9])], [c19, c20])).
% 11.14/1.97
% 11.14/1.97 cnf(c22, axiom,
% 11.14/1.97 p1(X10) | r1(X11,sK8(X11)) | ~r1(X10,X11) | ~r1(sK2,X10)).
% 11.14/1.97 cnf(a10, assumption,
% 11.14/1.97 X9 = X11).
% 11.14/1.97 cnf(a11, assumption,
% 11.14/1.97 X8 = sK8(X11)).
% 11.14/1.97 cnf(c23, plain,
% 11.14/1.97 ~r1(X7,X9) | ~r1(sK2,X7),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a10, a11])], [c21, c22])).
% 11.14/1.97 cnf(c24, plain,
% 11.14/1.97 p1(X10) | ~r1(X10,X11) | ~r1(sK2,X10),
% 11.14/1.97 inference(strict_predicate_extension, [assumptions([a10, a11])], [c21, c22])).
% 11.14/1.97
% 11.14/1.97 cnf(c25, plain,
% 11.14/1.97 ~p1(X1)).
% 11.14/1.97 cnf(a12, assumption,
% 11.14/1.97 X10 = X1).
% 11.14/1.97 cnf(c26, plain,
% 11.14/1.97 ~r1(X10,X11) | ~r1(sK2,X10),
% 11.14/1.97 inference(predicate_reduction, [assumptions([a12])], [c24, c25])).
% 11.14/1.97
% 11.14/1.97 cnf(c27, plain,
% 11.14/1.97 r1(X0,sK4(X0))).
% 11.14/1.97 cnf(a13, assumption,
% 11.14/1.97 X10 = X0).
% 11.14/1.97 cnf(a14, assumption,
% 11.14/1.97 X11 = sK4(X0)).
% 11.14/1.97 cnf(c28, plain,
% 11.14/1.97 ~r1(sK2,X10),
% 11.14/1.97 inference(predicate_reduction, [assumptions([a13, a14])], [c26, c27])).
% 11.14/1.97
% 11.14/1.97 cnf(c29, plain,
% 11.14/1.97 r1(sK2,sK3)).
% 11.14/1.97 cnf(a15, assumption,
% 11.14/1.97 sK2 = sK2).
% 11.14/1.97 cnf(a16, assumption,
% 11.14/1.97 X10 = sK3).
% 11.14/1.97 cnf(c30, plain,
% 11.14/1.97 $false,
% 11.14/1.97 inference(predicate_reduction, [assumptions([a15, a16])], [c28, c29])).
% 11.14/1.97
% 11.14/1.97 cnf(c31, plain,
% 11.14/1.97 r1(X0,sK4(X0))).
% 11.14/1.97 cnf(a17, assumption,
% 11.14/1.97 X7 = X0).
% 11.14/1.97 cnf(a18, assumption,
% 11.14/1.97 X9 = sK4(X0)).
% 11.14/1.97 cnf(c32, plain,
% 11.14/1.97 ~r1(sK2,X7),
% 11.14/1.97 inference(predicate_reduction, [assumptions([a17, a18])], [c23, c31])).
% 11.14/1.97
% 11.14/1.97 cnf(c33, plain,
% 11.14/1.97 r1(sK2,sK3)).
% 11.14/1.97 cnf(a19, assumption,
% 11.14/1.97 sK2 = sK2).
% 11.14/1.97 cnf(a20, assumption,
% 11.14/1.97 X7 = sK3).
% 11.14/1.97 cnf(c34, plain,
% 11.14/1.97 $false,
% 11.14/1.97 inference(predicate_reduction, [assumptions([a19, a20])], [c32, c33])).
% 11.14/1.97
% 11.14/1.97 cnf(c35, plain,
% 11.14/1.97 r1(X9,X8)).
% 11.14/1.97 cnf(a21, assumption,
% 11.14/1.97 X5 = X9).
% 11.14/1.97 cnf(a22, assumption,
% 11.14/1.97 X4 = X8).
% 11.14/1.97 cnf(c36, plain,
% 11.14/1.97 ~r1(X3,X5) | ~r1(sK2,X3),
% 11.14/1.97 inference(predicate_reduction, [assumptions([a21, a22])], [c15, c35])).
% 11.14/1.97
% 11.14/1.97 cnf(c37, plain,
% 11.14/1.97 r1(X0,sK4(X0))).
% 11.14/1.97 cnf(a23, assumption,
% 11.14/1.97 X3 = X0).
% 11.14/1.97 cnf(a24, assumption,
% 11.14/1.97 X5 = sK4(X0)).
% 11.14/1.97 cnf(c38, plain,
% 11.14/1.97 ~r1(sK2,X3),
% 11.36/1.97 inference(predicate_reduction, [assumptions([a23, a24])], [c36, c37])).
% 11.36/1.97
% 11.36/1.97 cnf(c39, plain,
% 11.36/1.97 r1(sK2,sK3)).
% 11.36/1.97 cnf(a25, assumption,
% 11.36/1.97 sK2 = sK2).
% 11.36/1.97 cnf(a26, assumption,
% 11.36/1.97 X3 = sK3).
% 11.36/1.97 cnf(c40, plain,
% 11.36/1.97 $false,
% 11.36/1.97 inference(predicate_reduction, [assumptions([a25, a26])], [c38, c39])).
% 11.36/1.97
% 11.36/1.97 cnf(c41, plain,
% 11.36/1.97 r1(sK2,sK3)).
% 11.36/1.97 cnf(a27, assumption,
% 11.36/1.97 sK2 = sK2).
% 11.36/1.97 cnf(a28, assumption,
% 11.36/1.97 X1 = sK3).
% 11.36/1.97 cnf(c42, plain,
% 11.36/1.97 $false,
% 11.36/1.97 inference(predicate_reduction, [assumptions([a27, a28])], [c12, c41])).
% 11.36/1.97
% 11.36/1.97 cnf(c43, plain,
% 11.36/1.97 $false,
% 11.36/1.97 inference(constraint_solving, [
% 11.36/1.97 bind(X0, sK3),
% 11.36/1.97 bind(X1, sK3),
% 11.36/1.97 bind(X2, sK4(X0)),
% 11.36/1.97 bind(X3, sK3),
% 11.36/1.97 bind(X4, sK8(X2)),
% 11.36/1.97 bind(X5, sK4(X0)),
% 11.36/1.97 bind(X6, sK5(X3)),
% 11.36/1.97 bind(X7, sK3),
% 11.36/1.97 bind(X8, sK8(X2)),
% 11.36/1.97 bind(X9, sK4(X0)),
% 11.36/1.97 bind(X10, sK3),
% 11.36/1.97 bind(X11, sK4(X0))
% 11.36/1.97 ],
% 11.36/1.97 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28])).
% 11.36/1.97
% 11.36/1.97 % SZS output end IncompleteProof
%------------------------------------------------------------------------------