TSTP Solution File: SEU140+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU140+2 : 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 : n028.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:25 EDT 2022
% Result : Theorem 3.37s 0.81s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU140+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n028.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 : Mon Jun 20 09:56:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.37/0.81 % SZS status Theorem
% 3.37/0.81 % SZS output begin IncompleteProof
% 3.37/0.81 cnf(c0, axiom,
% 3.37/0.81 ~disjoint(sK16,sK18)).
% 3.37/0.81 cnf(c1, plain,
% 3.37/0.81 ~disjoint(sK16,sK18),
% 3.37/0.81 inference(start, [], [c0])).
% 3.37/0.81
% 3.37/0.81 cnf(c2, axiom,
% 3.37/0.81 in(sK15(X0,X1),set_difference(X0,set_difference(X0,X1))) | disjoint(X0,X1)).
% 3.37/0.81 cnf(a0, assumption,
% 3.37/0.81 sK16 = X0).
% 3.37/0.81 cnf(a1, assumption,
% 3.37/0.81 sK18 = X1).
% 3.37/0.81 cnf(c3, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.37/0.81 cnf(c4, plain,
% 3.37/0.81 in(sK15(X0,X1),set_difference(X0,set_difference(X0,X1))),
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.37/0.81
% 3.37/0.81 cnf(c5, axiom,
% 3.37/0.81 in(X2,X3) | ~in(X2,X4) | ~subset(X4,X3)).
% 3.37/0.81 cnf(a2, assumption,
% 3.37/0.81 sK15(X0,X1) = X2).
% 3.37/0.81 cnf(a3, assumption,
% 3.37/0.81 set_difference(X0,set_difference(X0,X1)) = X4).
% 3.37/0.81 cnf(c6, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.37/0.81 cnf(c7, plain,
% 3.37/0.81 in(X2,X3) | ~subset(X4,X3),
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.37/0.81
% 3.37/0.81 cnf(c8, axiom,
% 3.37/0.81 ~disjoint(X5,X6) | ~in(X7,set_difference(X5,set_difference(X5,X6)))).
% 3.37/0.81 cnf(a4, assumption,
% 3.37/0.81 X2 = X7).
% 3.37/0.81 cnf(a5, assumption,
% 3.37/0.81 X3 = set_difference(X5,set_difference(X5,X6))).
% 3.37/0.81 cnf(c9, plain,
% 3.37/0.81 ~subset(X4,X3),
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 3.37/0.81 cnf(c10, plain,
% 3.37/0.81 ~disjoint(X5,X6),
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 3.37/0.81
% 3.37/0.81 cnf(c11, axiom,
% 3.37/0.81 disjoint(sK17,sK18)).
% 3.37/0.81 cnf(a6, assumption,
% 3.37/0.81 X5 = sK17).
% 3.37/0.81 cnf(a7, assumption,
% 3.37/0.81 X6 = sK18).
% 3.37/0.81 cnf(c12, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 3.37/0.81 cnf(c13, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 3.37/0.81
% 3.37/0.81 cnf(c14, axiom,
% 3.37/0.81 subset(set_difference(X8,set_difference(X8,X9)),set_difference(X10,set_difference(X10,X9))) | ~subset(X8,X10)).
% 3.37/0.81 cnf(a8, assumption,
% 3.37/0.81 X4 = set_difference(X8,set_difference(X8,X9))).
% 3.37/0.81 cnf(a9, assumption,
% 3.37/0.81 X3 = set_difference(X10,set_difference(X10,X9))).
% 3.37/0.81 cnf(c15, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 3.37/0.81 cnf(c16, plain,
% 3.37/0.81 ~subset(X8,X10),
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 3.37/0.81
% 3.37/0.81 cnf(c17, axiom,
% 3.37/0.81 subset(sK16,sK17)).
% 3.37/0.81 cnf(a10, assumption,
% 3.37/0.81 X8 = sK16).
% 3.37/0.81 cnf(a11, assumption,
% 3.37/0.81 X10 = sK17).
% 3.37/0.81 cnf(c18, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 3.37/0.81 cnf(c19, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 3.37/0.81
% 3.37/0.81 cnf(c20, plain,
% 3.37/0.81 $false,
% 3.37/0.81 inference(constraint_solving, [
% 3.37/0.81 bind(X0, sK16),
% 3.37/0.81 bind(X1, sK18),
% 3.37/0.81 bind(X2, sK15(X0,X1)),
% 3.37/0.81 bind(X3, set_difference(X5,set_difference(X5,X6))),
% 3.37/0.81 bind(X4, set_difference(X0,set_difference(X0,X1))),
% 3.37/0.81 bind(X5, sK17),
% 3.37/0.81 bind(X6, sK18),
% 3.37/0.81 bind(X7, sK15(X0,X1)),
% 3.37/0.81 bind(X8, sK16),
% 3.37/0.81 bind(X9, sK18),
% 3.37/0.81 bind(X10, sK17)
% 3.37/0.81 ],
% 3.37/0.81 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 3.37/0.81
% 3.37/0.81 % SZS output end IncompleteProof
%------------------------------------------------------------------------------