TSTP Solution File: LCL656+1.001 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : LCL656+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 : n021.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:35 EDT 2022
% Result : Theorem 0.13s 0.36s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 07:18:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Theorem
% 0.13/0.36 % SZS output begin IncompleteProof
% 0.13/0.36 cnf(c0, axiom,
% 0.13/0.36 ~p101(sK8)).
% 0.13/0.36 cnf(c1, plain,
% 0.13/0.36 ~p101(sK8),
% 0.13/0.36 inference(start, [], [c0])).
% 0.13/0.36
% 0.13/0.36 cnf(c2, axiom,
% 0.13/0.36 ~p100(X0) | p101(X0) | sP0(X0) | ~sP2(X0)).
% 0.13/0.36 cnf(a0, assumption,
% 0.13/0.36 sK8 = X0).
% 0.13/0.36 cnf(c3, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36 cnf(c4, plain,
% 0.13/0.36 ~p100(X0) | sP0(X0) | ~sP2(X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.36
% 0.13/0.36 cnf(c5, axiom,
% 0.13/0.36 p100(sK8)).
% 0.13/0.36 cnf(a1, assumption,
% 0.13/0.36 X0 = sK8).
% 0.13/0.36 cnf(c6, plain,
% 0.13/0.36 sP0(X0) | ~sP2(X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.36 cnf(c7, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.36
% 0.13/0.36 cnf(c8, axiom,
% 0.13/0.36 ~p2(sK7(X1)) | ~sP0(X1)).
% 0.13/0.36 cnf(a2, assumption,
% 0.13/0.36 X0 = X1).
% 0.13/0.36 cnf(c9, plain,
% 0.13/0.36 ~sP2(X0),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 ~p2(sK7(X1)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, axiom,
% 0.13/0.36 p2(X2) | ~r1(sK8,X2)).
% 0.13/0.36 cnf(a3, assumption,
% 0.13/0.36 sK7(X1) = X2).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.36 cnf(c13, plain,
% 0.13/0.36 ~r1(sK8,X2),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c14, axiom,
% 0.13/0.36 r1(X3,sK7(X3)) | ~sP0(X3)).
% 0.13/0.36 cnf(a4, assumption,
% 0.13/0.36 sK8 = X3).
% 0.13/0.36 cnf(a5, assumption,
% 0.13/0.36 X2 = sK7(X3)).
% 0.13/0.36 cnf(c15, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c13, c14])).
% 0.13/0.36 cnf(c16, plain,
% 0.13/0.36 ~sP0(X3),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c13, c14])).
% 0.13/0.36
% 0.13/0.36 cnf(c17, plain,
% 0.13/0.36 sP0(X0)).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 X3 = X0).
% 0.13/0.36 cnf(c18, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a6])], [c16, c17])).
% 0.13/0.36
% 0.13/0.36 cnf(c19, axiom,
% 0.13/0.36 sP2(X4) | ~sP5(X4)).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 X0 = X4).
% 0.13/0.36 cnf(c20, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c9, c19])).
% 0.13/0.36 cnf(c21, plain,
% 0.13/0.36 ~sP5(X4),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c9, c19])).
% 0.13/0.36
% 0.13/0.36 cnf(c22, axiom,
% 0.13/0.36 sP5(X5) | ~r1(sK8,X5)).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 X4 = X5).
% 0.13/0.36 cnf(c23, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c21, c22])).
% 0.13/0.36 cnf(c24, plain,
% 0.13/0.36 ~r1(sK8,X5),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c21, c22])).
% 0.13/0.36
% 0.13/0.36 cnf(c25, axiom,
% 0.13/0.36 r1(X6,X6)).
% 0.13/0.36 cnf(a9, assumption,
% 0.13/0.36 sK8 = X6).
% 0.13/0.36 cnf(a10, assumption,
% 0.13/0.36 X5 = X6).
% 0.13/0.36 cnf(c26, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c24, c25])).
% 0.13/0.36 cnf(c27, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a9, a10])], [c24, c25])).
% 0.13/0.36
% 0.13/0.36 cnf(c28, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, sK8),
% 0.13/0.36 bind(X1, sK8),
% 0.13/0.36 bind(X2, sK7(X1)),
% 0.13/0.36 bind(X3, sK8),
% 0.13/0.36 bind(X4, sK8),
% 0.13/0.36 bind(X5, sK8),
% 0.13/0.36 bind(X6, sK8)
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------