TSTP Solution File: SEU151+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU151+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 : n016.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 : Tue Jul 19 11:53:32 EDT 2022
% Result : Theorem 5.23s 1.03s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.15 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36 % Computer : n016.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 : Sat Jun 18 23:52:38 EDT 2022
% 0.14/0.36 % CPUTime :
% 5.23/1.03 % SZS status Theorem
% 5.23/1.03 % SZS output begin IncompleteProof
% 5.23/1.03 cnf(c0, axiom,
% 5.23/1.03 unordered_pair(sK3,sK4) = unordered_pair(sK5,sK6)).
% 5.23/1.03 cnf(c1, plain,
% 5.23/1.03 unordered_pair(sK3,sK4) = unordered_pair(sK5,sK6),
% 5.23/1.03 inference(start, [], [c0])).
% 5.23/1.03
% 5.23/1.03 cnf(c2, axiom,
% 5.23/1.03 sP1(X0,X1,unordered_pair(X0,X1))).
% 5.23/1.03 cnf(a0, assumption,
% 5.23/1.03 unordered_pair(X0,X1) = unordered_pair(sK5,sK6)).
% 5.23/1.03 cnf(a1, assumption,
% 5.23/1.03 unordered_pair(sK3,sK4) = X2).
% 5.23/1.03 cnf(c3, plain,
% 5.23/1.03 $false,
% 5.23/1.03 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.23/1.03 cnf(c4, plain,
% 5.23/1.03 $false,
% 5.23/1.03 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.23/1.03 cnf(c5, plain,
% 5.23/1.03 sP1(X0,X1,X2),
% 5.23/1.03 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.23/1.03
% 5.23/1.03 cnf(c6, axiom,
% 5.23/1.03 sP0(X3,X4,X5) | ~in(X3,X6) | ~sP1(X5,X4,X6)).
% 5.23/1.03 cnf(a2, assumption,
% 5.23/1.03 X0 = X5).
% 5.23/1.03 cnf(a3, assumption,
% 5.23/1.03 X1 = X4).
% 5.23/1.03 cnf(a4, assumption,
% 5.23/1.03 X2 = X6).
% 5.23/1.03 cnf(c7, plain,
% 5.23/1.03 $false,
% 5.23/1.03 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 5.23/1.03 cnf(c8, plain,
% 5.23/1.03 sP0(X3,X4,X5) | ~in(X3,X6),
% 5.23/1.03 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c5, c6])).
% 5.23/1.04
% 5.23/1.04 cnf(c9, axiom,
% 5.23/1.04 X7 = X8 | X7 = X9 | ~sP0(X7,X8,X9)).
% 5.23/1.04 cnf(a5, assumption,
% 5.23/1.04 X3 = X7).
% 5.23/1.04 cnf(a6, assumption,
% 5.23/1.04 X4 = X8).
% 5.23/1.04 cnf(a7, assumption,
% 5.23/1.04 X5 = X9).
% 5.23/1.04 cnf(c10, plain,
% 5.23/1.04 ~in(X3,X6),
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c8, c9])).
% 5.23/1.04 cnf(c11, plain,
% 5.23/1.04 X7 = X8 | X7 = X9,
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c8, c9])).
% 5.23/1.04
% 5.23/1.04 cnf(c12, axiom,
% 5.23/1.04 sK3 != sK6).
% 5.23/1.04 cnf(a8, assumption,
% 5.23/1.04 sK6 = X8).
% 5.23/1.04 cnf(c13, plain,
% 5.23/1.04 X7 = X9,
% 5.23/1.04 inference(strict_subterm_extension, [assumptions([a8])], [c11, c12])).
% 5.23/1.04 cnf(c14, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_subterm_extension, [assumptions([a8])], [c11, c12])).
% 5.23/1.04 cnf(c15, plain,
% 5.23/1.04 sK3 != X7,
% 5.23/1.04 inference(strict_subterm_extension, [assumptions([a8])], [c11, c12])).
% 5.23/1.04
% 5.23/1.04 cnf(a9, assumption,
% 5.23/1.04 sK3 = X7).
% 5.23/1.04 cnf(c16, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(reflexivity, [assumptions([a9])], [c15])).
% 5.23/1.04
% 5.23/1.04 cnf(c17, axiom,
% 5.23/1.04 sK3 != sK5).
% 5.23/1.04 cnf(a10, assumption,
% 5.23/1.04 sK5 = X9).
% 5.23/1.04 cnf(c18, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_subterm_extension, [assumptions([a10])], [c13, c17])).
% 5.23/1.04 cnf(c19, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_subterm_extension, [assumptions([a10])], [c13, c17])).
% 5.23/1.04 cnf(c20, plain,
% 5.23/1.04 sK3 != X7,
% 5.23/1.04 inference(strict_subterm_extension, [assumptions([a10])], [c13, c17])).
% 5.23/1.04
% 5.23/1.04 cnf(a11, assumption,
% 5.23/1.04 sK3 = X7).
% 5.23/1.04 cnf(c21, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(reflexivity, [assumptions([a11])], [c20])).
% 5.23/1.04
% 5.23/1.04 cnf(c22, axiom,
% 5.23/1.04 in(X10,X11) | ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11)).
% 5.23/1.04 cnf(a12, assumption,
% 5.23/1.04 X3 = X10).
% 5.23/1.04 cnf(a13, assumption,
% 5.23/1.04 X6 = X11).
% 5.23/1.04 cnf(c23, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a12, a13])], [c10, c22])).
% 5.23/1.04 cnf(c24, plain,
% 5.23/1.04 ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11),
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a12, a13])], [c10, c22])).
% 5.23/1.04
% 5.23/1.04 cnf(c25, axiom,
% 5.23/1.04 sP0(X14,X15,X14)).
% 5.23/1.04 cnf(a14, assumption,
% 5.23/1.04 X10 = X14).
% 5.23/1.04 cnf(a15, assumption,
% 5.23/1.04 X12 = X15).
% 5.23/1.04 cnf(a16, assumption,
% 5.23/1.04 X13 = X14).
% 5.23/1.04 cnf(c26, plain,
% 5.23/1.04 ~sP1(X13,X12,X11),
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c24, c25])).
% 5.23/1.04 cnf(c27, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c24, c25])).
% 5.23/1.04
% 5.23/1.04 cnf(c28, axiom,
% 5.23/1.04 sP1(X16,X17,unordered_pair(X16,X17))).
% 5.23/1.04 cnf(a17, assumption,
% 5.23/1.04 X13 = X16).
% 5.23/1.04 cnf(a18, assumption,
% 5.23/1.04 X12 = X17).
% 5.23/1.04 cnf(a19, assumption,
% 5.23/1.04 X11 = unordered_pair(X16,X17)).
% 5.23/1.04 cnf(c29, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c26, c28])).
% 5.23/1.04 cnf(c30, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c26, c28])).
% 5.23/1.04
% 5.23/1.04 cnf(c31, plain,
% 5.23/1.04 $false,
% 5.23/1.04 inference(constraint_solving, [
% 5.23/1.04 bind(X0, sK5),
% 5.23/1.04 bind(X1, sK6),
% 5.23/1.04 bind(X2, unordered_pair(sK3,sK4)),
% 5.23/1.04 bind(X3, sK3),
% 5.23/1.04 bind(X4, sK6),
% 5.23/1.04 bind(X5, sK5),
% 5.23/1.04 bind(X6, unordered_pair(sK3,sK4)),
% 5.23/1.04 bind(X7, sK3),
% 5.23/1.04 bind(X8, sK6),
% 5.23/1.04 bind(X9, sK5),
% 5.23/1.04 bind(X10, sK3),
% 5.23/1.04 bind(X11, unordered_pair(sK3,sK4)),
% 5.23/1.04 bind(X12, sK4),
% 5.23/1.04 bind(X13, sK3),
% 5.23/1.04 bind(X14, sK3),
% 5.23/1.04 bind(X15, sK4),
% 5.23/1.04 bind(X16, sK3),
% 5.23/1.04 bind(X17, sK4)
% 5.23/1.04 ],
% 5.23/1.04 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 5.23/1.04
% 5.23/1.04 % SZS output end IncompleteProof
%------------------------------------------------------------------------------