TSTP Solution File: SET790+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET790+4 : TPTP v8.1.0. Released v3.2.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 : Tue Jul 19 02:48:08 EDT 2022
% Result : Theorem 146.65s 19.82s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET790+4 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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 : Sun Jul 10 09:28:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 146.65/19.82 % SZS status Theorem
% 146.65/19.82 % SZS output begin IncompleteProof
% 146.65/19.82 cnf(c0, axiom,
% 146.65/19.82 least(sK28,sK26,sK27)).
% 146.65/19.82 cnf(c1, plain,
% 146.65/19.82 least(sK28,sK26,sK27),
% 146.65/19.82 inference(start, [], [c0])).
% 146.65/19.82
% 146.65/19.82 cnf(c2, axiom,
% 146.65/19.82 sP5(X0,X1,X2) | ~least(X0,X1,X2)).
% 146.65/19.82 cnf(a0, assumption,
% 146.65/19.82 sK28 = X0).
% 146.65/19.82 cnf(a1, assumption,
% 146.65/19.82 sK26 = X1).
% 146.65/19.82 cnf(a2, assumption,
% 146.65/19.82 sK27 = X2).
% 146.65/19.82 cnf(c3, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 146.65/19.82 cnf(c4, plain,
% 146.65/19.82 sP5(X0,X1,X2),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 146.65/19.82
% 146.65/19.82 cnf(c5, axiom,
% 146.65/19.82 apply(X3,X4,X5) | ~member(X5,X6) | ~sP5(X4,X3,X6)).
% 146.65/19.82 cnf(a3, assumption,
% 146.65/19.82 X0 = X4).
% 146.65/19.82 cnf(a4, assumption,
% 146.65/19.82 X1 = X3).
% 146.65/19.82 cnf(a5, assumption,
% 146.65/19.82 X2 = X6).
% 146.65/19.82 cnf(c6, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 146.65/19.82 cnf(c7, plain,
% 146.65/19.82 apply(X3,X4,X5) | ~member(X5,X6),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c4, c5])).
% 146.65/19.82
% 146.65/19.82 cnf(c8, axiom,
% 146.65/19.82 X7 = X8 | ~apply(X9,X8,X7) | ~apply(X9,X7,X8) | ~member(X8,X10) | ~member(X7,X10) | ~sP0(X9,X10)).
% 146.65/19.82 cnf(a6, assumption,
% 146.65/19.82 X3 = X9).
% 146.65/19.82 cnf(a7, assumption,
% 146.65/19.82 X4 = X7).
% 146.65/19.82 cnf(a8, assumption,
% 146.65/19.82 X5 = X8).
% 146.65/19.82 cnf(c9, plain,
% 146.65/19.82 ~member(X5,X6),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 146.65/19.82 cnf(c10, plain,
% 146.65/19.82 X7 = X8 | ~apply(X9,X8,X7) | ~member(X8,X10) | ~member(X7,X10) | ~sP0(X9,X10),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c7, c8])).
% 146.65/19.82
% 146.65/19.82 cnf(c11, axiom,
% 146.65/19.82 sK28 != sK29).
% 146.65/19.82 cnf(a9, assumption,
% 146.65/19.82 sK29 = X8).
% 146.65/19.82 cnf(c12, plain,
% 146.65/19.82 ~apply(X9,X8,X7) | ~member(X8,X10) | ~member(X7,X10) | ~sP0(X9,X10),
% 146.65/19.82 inference(strict_subterm_extension, [assumptions([a9])], [c10, c11])).
% 146.65/19.82 cnf(c13, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_subterm_extension, [assumptions([a9])], [c10, c11])).
% 146.65/19.82 cnf(c14, plain,
% 146.65/19.82 sK28 != X7,
% 146.65/19.82 inference(strict_subterm_extension, [assumptions([a9])], [c10, c11])).
% 146.65/19.82
% 146.65/19.82 cnf(a10, assumption,
% 146.65/19.82 sK28 = X7).
% 146.65/19.82 cnf(c15, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(reflexivity, [assumptions([a10])], [c14])).
% 146.65/19.82
% 146.65/19.82 cnf(c16, axiom,
% 146.65/19.82 apply(X11,X12,X13) | ~member(X13,X14) | ~sP5(X12,X11,X14)).
% 146.65/19.82 cnf(a11, assumption,
% 146.65/19.82 X9 = X11).
% 146.65/19.82 cnf(a12, assumption,
% 146.65/19.82 X8 = X12).
% 146.65/19.82 cnf(a13, assumption,
% 146.65/19.82 X7 = X13).
% 146.65/19.82 cnf(c17, plain,
% 146.65/19.82 ~member(X8,X10) | ~member(X7,X10) | ~sP0(X9,X10),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c12, c16])).
% 146.65/19.82 cnf(c18, plain,
% 146.65/19.82 ~member(X13,X14) | ~sP5(X12,X11,X14),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c12, c16])).
% 146.65/19.82
% 146.65/19.82 cnf(c19, axiom,
% 146.65/19.82 member(X15,X16) | ~sP5(X15,X17,X16)).
% 146.65/19.82 cnf(a14, assumption,
% 146.65/19.82 X13 = X15).
% 146.65/19.82 cnf(a15, assumption,
% 146.65/19.82 X14 = X16).
% 146.65/19.82 cnf(c20, plain,
% 146.65/19.82 ~sP5(X12,X11,X14),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c19])).
% 146.65/19.82 cnf(c21, plain,
% 146.65/19.82 ~sP5(X15,X17,X16),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c19])).
% 146.65/19.82
% 146.65/19.82 cnf(c22, plain,
% 146.65/19.82 sP5(X0,X1,X2)).
% 146.65/19.82 cnf(a16, assumption,
% 146.65/19.82 X15 = X0).
% 146.65/19.82 cnf(a17, assumption,
% 146.65/19.82 X17 = X1).
% 146.65/19.82 cnf(a18, assumption,
% 146.65/19.82 X16 = X2).
% 146.65/19.82 cnf(c23, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(predicate_reduction, [assumptions([a16, a17, a18])], [c21, c22])).
% 146.65/19.82
% 146.65/19.82 cnf(c24, axiom,
% 146.65/19.82 sP5(X18,X19,X20) | ~least(X18,X19,X20)).
% 146.65/19.82 cnf(a19, assumption,
% 146.65/19.82 X12 = X18).
% 146.65/19.82 cnf(a20, assumption,
% 146.65/19.82 X11 = X19).
% 146.65/19.82 cnf(a21, assumption,
% 146.65/19.82 X14 = X20).
% 146.65/19.82 cnf(c25, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c20, c24])).
% 146.65/19.82 cnf(c26, plain,
% 146.65/19.82 ~least(X18,X19,X20),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c20, c24])).
% 146.65/19.82
% 146.65/19.82 cnf(c27, axiom,
% 146.65/19.82 least(sK29,sK26,sK27)).
% 146.65/19.82 cnf(a22, assumption,
% 146.65/19.82 X18 = sK29).
% 146.65/19.82 cnf(a23, assumption,
% 146.65/19.82 X19 = sK26).
% 146.65/19.82 cnf(a24, assumption,
% 146.65/19.82 X20 = sK27).
% 146.65/19.82 cnf(c28, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a22, a23, a24])], [c26, c27])).
% 146.65/19.82 cnf(c29, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a22, a23, a24])], [c26, c27])).
% 146.65/19.82
% 146.65/19.82 cnf(c30, axiom,
% 146.65/19.82 member(X21,X22) | ~sP5(X21,X23,X22)).
% 146.65/19.82 cnf(a25, assumption,
% 146.65/19.82 X8 = X21).
% 146.65/19.82 cnf(a26, assumption,
% 146.65/19.82 X10 = X22).
% 146.65/19.82 cnf(c31, plain,
% 146.65/19.82 ~member(X7,X10) | ~sP0(X9,X10),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a25, a26])], [c17, c30])).
% 146.65/19.82 cnf(c32, plain,
% 146.65/19.82 ~sP5(X21,X23,X22),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a25, a26])], [c17, c30])).
% 146.65/19.82
% 146.65/19.82 cnf(c33, plain,
% 146.65/19.82 sP5(X12,X11,X14)).
% 146.65/19.82 cnf(a27, assumption,
% 146.65/19.82 X21 = X12).
% 146.65/19.82 cnf(a28, assumption,
% 146.65/19.82 X23 = X11).
% 146.65/19.82 cnf(a29, assumption,
% 146.65/19.82 X22 = X14).
% 146.65/19.82 cnf(c34, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(predicate_reduction, [assumptions([a27, a28, a29])], [c32, c33])).
% 146.65/19.82
% 146.65/19.82 cnf(c35, plain,
% 146.65/19.82 member(X13,X14)).
% 146.65/19.82 cnf(a30, assumption,
% 146.65/19.82 X7 = X13).
% 146.65/19.82 cnf(a31, assumption,
% 146.65/19.82 X10 = X14).
% 146.65/19.82 cnf(c36, plain,
% 146.65/19.82 ~sP0(X9,X10),
% 146.65/19.82 inference(predicate_reduction, [assumptions([a30, a31])], [c31, c35])).
% 146.65/19.82
% 146.65/19.82 cnf(c37, axiom,
% 146.65/19.82 sP0(X24,X25) | ~sP2(X25,X24)).
% 146.65/19.82 cnf(a32, assumption,
% 146.65/19.82 X9 = X24).
% 146.65/19.82 cnf(a33, assumption,
% 146.65/19.82 X10 = X25).
% 146.65/19.82 cnf(c38, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a32, a33])], [c36, c37])).
% 146.65/19.82 cnf(c39, plain,
% 146.65/19.82 ~sP2(X25,X24),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a32, a33])], [c36, c37])).
% 146.65/19.82
% 146.65/19.82 cnf(c40, axiom,
% 146.65/19.82 sP2(X26,X27) | ~order(X27,X26)).
% 146.65/19.82 cnf(a34, assumption,
% 146.65/19.82 X25 = X26).
% 146.65/19.82 cnf(a35, assumption,
% 146.65/19.82 X24 = X27).
% 146.65/19.82 cnf(c41, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a34, a35])], [c39, c40])).
% 146.65/19.82 cnf(c42, plain,
% 146.65/19.82 ~order(X27,X26),
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a34, a35])], [c39, c40])).
% 146.65/19.82
% 146.65/19.82 cnf(c43, axiom,
% 146.65/19.82 order(sK26,sK27)).
% 146.65/19.82 cnf(a36, assumption,
% 146.65/19.82 X27 = sK26).
% 146.65/19.82 cnf(a37, assumption,
% 146.65/19.82 X26 = sK27).
% 146.65/19.82 cnf(c44, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a36, a37])], [c42, c43])).
% 146.65/19.82 cnf(c45, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(strict_predicate_extension, [assumptions([a36, a37])], [c42, c43])).
% 146.65/19.82
% 146.65/19.82 cnf(c46, plain,
% 146.65/19.82 member(X8,X10)).
% 146.65/19.82 cnf(a38, assumption,
% 146.65/19.82 X5 = X8).
% 146.65/19.82 cnf(a39, assumption,
% 146.65/19.82 X6 = X10).
% 146.65/19.82 cnf(c47, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(predicate_reduction, [assumptions([a38, a39])], [c9, c46])).
% 146.65/19.82
% 146.65/19.82 cnf(c48, plain,
% 146.65/19.82 $false,
% 146.65/19.82 inference(constraint_solving, [
% 146.65/19.82 bind(X0, sK28),
% 146.65/19.82 bind(X1, sK26),
% 146.65/19.82 bind(X2, sK27),
% 146.65/19.82 bind(X3, sK26),
% 146.65/19.82 bind(X4, sK28),
% 146.65/19.82 bind(X5, sK29),
% 146.65/19.82 bind(X6, sK27),
% 146.65/19.82 bind(X7, sK28),
% 146.65/19.82 bind(X8, sK29),
% 146.65/19.82 bind(X9, sK26),
% 146.65/19.82 bind(X10, sK27),
% 146.65/19.82 bind(X11, sK26),
% 146.65/19.82 bind(X12, sK29),
% 146.65/19.82 bind(X13, sK28),
% 146.65/19.82 bind(X14, sK27),
% 146.65/19.82 bind(X15, sK28),
% 146.65/19.82 bind(X16, sK27),
% 146.65/19.82 bind(X17, sK26),
% 146.65/19.82 bind(X18, sK29),
% 146.65/19.82 bind(X19, sK26),
% 146.65/19.82 bind(X20, sK27),
% 146.65/19.82 bind(X21, sK29),
% 146.65/19.82 bind(X22, sK27),
% 146.65/19.82 bind(X23, sK26),
% 146.65/19.82 bind(X24, sK26),
% 146.65/19.82 bind(X25, sK27),
% 146.65/19.82 bind(X26, sK27),
% 146.65/19.82 bind(X27, sK26)
% 146.65/19.82 ],
% 146.65/19.82 [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, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39])).
% 146.65/19.82
% 146.65/19.82 % SZS output end IncompleteProof
%------------------------------------------------------------------------------