TSTP Solution File: LCL686+1.020 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL686+1.020 : 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 : n012.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:19 EDT 2022
% Result : Theorem 11.84s 1.96s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL686+1.020 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 21:33:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 11.84/1.96 % SZS status Theorem
% 11.84/1.96 % SZS output begin IncompleteProof
% 11.84/1.96 cnf(c0, axiom,
% 11.84/1.96 sP117(X0) | ~r1(sK179,X0)).
% 11.84/1.96 cnf(c1, plain,
% 11.84/1.96 sP117(X0) | ~r1(sK179,X0),
% 11.84/1.96 inference(start, [], [c0])).
% 11.84/1.96
% 11.84/1.96 cnf(c2, axiom,
% 11.84/1.96 sP115(X1) | ~sP117(X1)).
% 11.84/1.96 cnf(a0, assumption,
% 11.84/1.96 X0 = X1).
% 11.84/1.96 cnf(c3, plain,
% 11.84/1.96 ~r1(sK179,X0),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 11.84/1.96 cnf(c4, plain,
% 11.84/1.96 sP115(X1),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 11.84/1.96
% 11.84/1.96 cnf(c5, axiom,
% 11.84/1.96 p1(X2) | ~p2(X2) | ~r1(X3,X2) | ~sP115(X3)).
% 11.84/1.96 cnf(a1, assumption,
% 11.84/1.96 X1 = X3).
% 11.84/1.96 cnf(c6, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 11.84/1.96 cnf(c7, plain,
% 11.84/1.96 p1(X2) | ~p2(X2) | ~r1(X3,X2),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 11.84/1.96
% 11.84/1.96 cnf(c8, axiom,
% 11.84/1.96 ~p1(sK119(X4)) | ~p2(sK119(X4)) | ~sP114(X4)).
% 11.84/1.96 cnf(a2, assumption,
% 11.84/1.96 X2 = sK119(X4)).
% 11.84/1.96 cnf(c9, plain,
% 11.84/1.96 ~p2(X2) | ~r1(X3,X2),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 11.84/1.96 cnf(c10, plain,
% 11.84/1.96 ~p2(sK119(X4)) | ~sP114(X4),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 11.84/1.96
% 11.84/1.96 cnf(c11, axiom,
% 11.84/1.96 ~p1(X5) | p2(X5) | ~r1(X6,X5) | ~sP115(X6)).
% 11.84/1.96 cnf(a3, assumption,
% 11.84/1.96 sK119(X4) = X5).
% 11.84/1.96 cnf(c12, plain,
% 11.84/1.96 ~sP114(X4),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 11.84/1.96 cnf(c13, plain,
% 11.84/1.96 ~p1(X5) | ~r1(X6,X5) | ~sP115(X6),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 11.84/1.96
% 11.84/1.96 cnf(c14, plain,
% 11.84/1.96 p1(X2)).
% 11.84/1.96 cnf(a4, assumption,
% 11.84/1.96 X5 = X2).
% 11.84/1.96 cnf(c15, plain,
% 11.84/1.96 ~r1(X6,X5) | ~sP115(X6),
% 11.84/1.96 inference(predicate_reduction, [assumptions([a4])], [c13, c14])).
% 11.84/1.96
% 11.84/1.96 cnf(c16, axiom,
% 11.84/1.96 r1(X7,sK119(X7)) | ~sP114(X7)).
% 11.84/1.96 cnf(a5, assumption,
% 11.84/1.96 X6 = X7).
% 11.84/1.96 cnf(a6, assumption,
% 11.84/1.96 X5 = sK119(X7)).
% 11.84/1.96 cnf(c17, plain,
% 11.84/1.96 ~sP115(X6),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a5, a6])], [c15, c16])).
% 11.84/1.96 cnf(c18, plain,
% 11.84/1.96 ~sP114(X7),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a5, a6])], [c15, c16])).
% 11.84/1.96
% 11.84/1.96 cnf(c19, axiom,
% 11.84/1.96 sP114(X8) | ~sP117(X8)).
% 11.84/1.96 cnf(a7, assumption,
% 11.84/1.96 X7 = X8).
% 11.84/1.96 cnf(c20, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a7])], [c18, c19])).
% 11.84/1.96 cnf(c21, plain,
% 11.84/1.96 ~sP117(X8),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a7])], [c18, c19])).
% 11.84/1.96
% 11.84/1.96 cnf(c22, plain,
% 11.84/1.96 sP117(X0)).
% 11.84/1.96 cnf(a8, assumption,
% 11.84/1.96 X8 = X0).
% 11.84/1.96 cnf(c23, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(predicate_reduction, [assumptions([a8])], [c21, c22])).
% 11.84/1.96
% 11.84/1.96 cnf(c24, plain,
% 11.84/1.96 sP115(X1)).
% 11.84/1.96 cnf(a9, assumption,
% 11.84/1.96 X6 = X1).
% 11.84/1.96 cnf(c25, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(predicate_reduction, [assumptions([a9])], [c17, c24])).
% 11.84/1.96
% 11.84/1.96 cnf(c26, plain,
% 11.84/1.96 sP114(X7)).
% 11.84/1.96 cnf(a10, assumption,
% 11.84/1.96 X4 = X7).
% 11.84/1.96 cnf(c27, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(predicate_reduction, [assumptions([a10])], [c12, c26])).
% 11.84/1.96
% 11.84/1.96 cnf(c28, axiom,
% 11.84/1.96 p2(sK119(X9)) | p1(sK119(X9)) | ~sP114(X9)).
% 11.84/1.96 cnf(a11, assumption,
% 11.84/1.96 X2 = sK119(X9)).
% 11.84/1.96 cnf(c29, plain,
% 11.84/1.96 ~r1(X3,X2),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a11])], [c9, c28])).
% 11.84/1.96 cnf(c30, plain,
% 11.84/1.96 p1(sK119(X9)) | ~sP114(X9),
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a11])], [c9, c28])).
% 11.84/1.96
% 11.84/1.96 cnf(c31, plain,
% 11.84/1.96 ~p1(X2)).
% 11.84/1.96 cnf(a12, assumption,
% 11.84/1.96 sK119(X9) = X2).
% 11.84/1.96 cnf(c32, plain,
% 11.84/1.96 ~sP114(X9),
% 11.84/1.96 inference(predicate_reduction, [assumptions([a12])], [c30, c31])).
% 11.84/1.96
% 11.84/1.96 cnf(c33, plain,
% 11.84/1.96 sP114(X7)).
% 11.84/1.96 cnf(a13, assumption,
% 11.84/1.96 X9 = X7).
% 11.84/1.96 cnf(c34, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(predicate_reduction, [assumptions([a13])], [c32, c33])).
% 11.84/1.96
% 11.84/1.96 cnf(c35, plain,
% 11.84/1.96 r1(X6,X5)).
% 11.84/1.96 cnf(a14, assumption,
% 11.84/1.96 X3 = X6).
% 11.84/1.96 cnf(a15, assumption,
% 11.84/1.96 X2 = X5).
% 11.84/1.96 cnf(c36, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(predicate_reduction, [assumptions([a14, a15])], [c29, c35])).
% 11.84/1.96
% 11.84/1.96 cnf(c37, axiom,
% 11.84/1.96 r1(X10,X10)).
% 11.84/1.96 cnf(a16, assumption,
% 11.84/1.96 sK179 = X10).
% 11.84/1.96 cnf(a17, assumption,
% 11.84/1.96 X0 = X10).
% 11.84/1.96 cnf(c38, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])).
% 11.84/1.96 cnf(c39, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(strict_predicate_extension, [assumptions([a16, a17])], [c3, c37])).
% 11.84/1.96
% 11.84/1.96 cnf(c40, plain,
% 11.84/1.96 $false,
% 11.84/1.96 inference(constraint_solving, [
% 11.84/1.96 bind(X0, sK179),
% 11.84/1.96 bind(X1, sK179),
% 11.84/1.96 bind(X2, sK119(X4)),
% 11.84/1.96 bind(X3, sK179),
% 11.84/1.96 bind(X4, sK179),
% 11.84/1.96 bind(X5, sK119(X4)),
% 11.84/1.96 bind(X6, sK179),
% 11.84/1.96 bind(X7, sK179),
% 11.84/1.96 bind(X8, sK179),
% 11.84/1.96 bind(X9, sK179),
% 11.84/1.96 bind(X10, sK179)
% 11.84/1.96 ],
% 11.84/1.96 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 11.84/1.96
% 11.84/1.96 % SZS output end IncompleteProof
%------------------------------------------------------------------------------