TSTP Solution File: SET603+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET603+3 : TPTP v8.1.0. Released v2.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 : n007.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:46:55 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 14:24:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 % SZS output begin IncompleteProof
% 0.19/0.46 cnf(c0, axiom,
% 0.19/0.46 sK5 != difference(sK5,empty_set)).
% 0.19/0.46 cnf(c1, plain,
% 0.19/0.46 sK5 != difference(sK5,empty_set),
% 0.19/0.46 inference(start, [], [c0])).
% 0.19/0.46
% 0.19/0.46 cnf(c2, axiom,
% 0.19/0.46 X0 = X1 | ~sP0(X1,X0)).
% 0.19/0.46 cnf(a0, assumption,
% 0.19/0.46 difference(sK5,empty_set) = X0).
% 0.19/0.46 cnf(c3, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.46 cnf(c4, plain,
% 0.19/0.46 ~sP0(X1,X0),
% 0.19/0.46 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.46 cnf(c5, plain,
% 0.19/0.46 X1 != X2 | sK5 != X2,
% 0.19/0.46 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.46
% 0.19/0.46 cnf(a1, assumption,
% 0.19/0.46 X1 = X2).
% 0.19/0.46 cnf(c6, plain,
% 0.19/0.46 sK5 != X2,
% 0.19/0.46 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.19/0.46
% 0.19/0.46 cnf(a2, assumption,
% 0.19/0.46 sK5 = X2).
% 0.19/0.46 cnf(c7, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.19/0.46
% 0.19/0.46 cnf(c8, axiom,
% 0.19/0.46 sP0(X3,X4) | member(sK2(X3,X4),X3) | member(sK2(X3,X4),X4)).
% 0.19/0.46 cnf(a3, assumption,
% 0.19/0.46 X1 = X3).
% 0.19/0.46 cnf(a4, assumption,
% 0.19/0.46 X0 = X4).
% 0.19/0.46 cnf(c9, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.19/0.46 cnf(c10, plain,
% 0.19/0.46 member(sK2(X3,X4),X3) | member(sK2(X3,X4),X4),
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.19/0.46
% 0.19/0.46 cnf(c11, axiom,
% 0.19/0.46 sP0(X5,X6) | ~member(sK2(X5,X6),X5) | ~member(sK2(X5,X6),X6)).
% 0.19/0.46 cnf(a5, assumption,
% 0.19/0.46 sK2(X3,X4) = sK2(X5,X6)).
% 0.19/0.46 cnf(a6, assumption,
% 0.19/0.46 X3 = X5).
% 0.19/0.46 cnf(c12, plain,
% 0.19/0.46 member(sK2(X3,X4),X4),
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.19/0.46 cnf(c13, plain,
% 0.19/0.46 sP0(X5,X6) | ~member(sK2(X5,X6),X6),
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.19/0.46
% 0.19/0.46 cnf(c14, plain,
% 0.19/0.46 ~sP0(X1,X0)).
% 0.19/0.46 cnf(a7, assumption,
% 0.19/0.46 X5 = X1).
% 0.19/0.46 cnf(a8, assumption,
% 0.19/0.46 X6 = X0).
% 0.19/0.46 cnf(c15, plain,
% 0.19/0.46 ~member(sK2(X5,X6),X6),
% 0.19/0.46 inference(predicate_reduction, [assumptions([a7, a8])], [c13, c14])).
% 0.19/0.46
% 0.19/0.46 cnf(c16, axiom,
% 0.19/0.46 member(X7,difference(X8,X9)) | member(X7,X9) | ~member(X7,X8)).
% 0.19/0.46 cnf(a9, assumption,
% 0.19/0.46 sK2(X5,X6) = X7).
% 0.19/0.46 cnf(a10, assumption,
% 0.19/0.46 X6 = difference(X8,X9)).
% 0.19/0.46 cnf(c17, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 0.19/0.46 cnf(c18, plain,
% 0.19/0.46 member(X7,X9) | ~member(X7,X8),
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 0.19/0.46
% 0.19/0.46 cnf(c19, axiom,
% 0.19/0.46 ~member(X10,empty_set)).
% 0.19/0.46 cnf(a11, assumption,
% 0.19/0.46 X7 = X10).
% 0.19/0.46 cnf(a12, assumption,
% 0.19/0.46 X9 = empty_set).
% 0.19/0.46 cnf(c20, plain,
% 0.19/0.46 ~member(X7,X8),
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 0.19/0.46 cnf(c21, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 0.19/0.46
% 0.19/0.46 cnf(c22, plain,
% 0.19/0.46 member(sK2(X3,X4),X3)).
% 0.19/0.46 cnf(a13, assumption,
% 0.19/0.46 X7 = sK2(X3,X4)).
% 0.19/0.46 cnf(a14, assumption,
% 0.19/0.46 X8 = X3).
% 0.19/0.46 cnf(c23, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(predicate_reduction, [assumptions([a13, a14])], [c20, c22])).
% 0.19/0.46
% 0.19/0.46 cnf(c24, axiom,
% 0.19/0.46 member(X11,X12) | ~member(X11,difference(X12,X13))).
% 0.19/0.46 cnf(a15, assumption,
% 0.19/0.46 sK2(X3,X4) = X11).
% 0.19/0.46 cnf(a16, assumption,
% 0.19/0.46 X4 = difference(X12,X13)).
% 0.19/0.46 cnf(c25, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a15, a16])], [c12, c24])).
% 0.19/0.46 cnf(c26, plain,
% 0.19/0.46 member(X11,X12),
% 0.19/0.46 inference(strict_predicate_extension, [assumptions([a15, a16])], [c12, c24])).
% 0.19/0.46
% 0.19/0.46 cnf(c27, plain,
% 0.19/0.46 ~member(sK2(X3,X4),X3)).
% 0.19/0.46 cnf(a17, assumption,
% 0.19/0.46 X11 = sK2(X3,X4)).
% 0.19/0.46 cnf(a18, assumption,
% 0.19/0.46 X12 = X3).
% 0.19/0.46 cnf(c28, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(predicate_reduction, [assumptions([a17, a18])], [c26, c27])).
% 0.19/0.46
% 0.19/0.46 cnf(c29, plain,
% 0.19/0.46 $false,
% 0.19/0.46 inference(constraint_solving, [
% 0.19/0.46 bind(X0, difference(sK5,empty_set)),
% 0.19/0.46 bind(X1, sK5),
% 0.19/0.46 bind(X2, sK5),
% 0.19/0.46 bind(X3, sK5),
% 0.19/0.46 bind(X4, difference(sK5,empty_set)),
% 0.19/0.46 bind(X5, sK5),
% 0.19/0.46 bind(X6, difference(sK5,empty_set)),
% 0.19/0.46 bind(X7, sK2(X5,X6)),
% 0.19/0.46 bind(X8, sK5),
% 0.19/0.46 bind(X9, empty_set),
% 0.19/0.46 bind(X10, sK2(X5,X6)),
% 0.19/0.46 bind(X11, sK2(X3,X4)),
% 0.19/0.46 bind(X12, sK5),
% 0.19/0.46 bind(X13, empty_set)
% 0.19/0.46 ],
% 0.19/0.46 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 0.19/0.46
% 0.19/0.46 % SZS output end IncompleteProof
%------------------------------------------------------------------------------