TSTP Solution File: SET081+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET081+1 : TPTP v8.1.0. Bugfixed v5.4.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:43:30 EDT 2022
% Result : Theorem 9.66s 1.63s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET081+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.12/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n007.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 : Mon Jul 11 05:47:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 9.66/1.63 % SZS status Theorem
% 9.66/1.63 % SZS output begin IncompleteProof
% 9.66/1.63 cnf(c0, axiom,
% 9.66/1.63 member(sK10,unordered_pair(sK9,sK9))).
% 9.66/1.63 cnf(c1, plain,
% 9.66/1.63 member(sK10,unordered_pair(sK9,sK9)),
% 9.66/1.63 inference(start, [], [c0])).
% 9.66/1.63
% 9.66/1.63 cnf(c2, axiom,
% 9.66/1.63 sP0(X0,X1,X2) | ~member(X1,unordered_pair(X2,X0))).
% 9.66/1.63 cnf(a0, assumption,
% 9.66/1.63 sK10 = X1).
% 9.66/1.63 cnf(a1, assumption,
% 9.66/1.63 unordered_pair(sK9,sK9) = unordered_pair(X2,X0)).
% 9.66/1.63 cnf(c3, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.66/1.63 cnf(c4, plain,
% 9.66/1.63 sP0(X0,X1,X2),
% 9.66/1.63 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.66/1.63
% 9.66/1.63 cnf(c5, axiom,
% 9.66/1.63 X3 = X4 | X4 = X5 | ~sP0(X3,X4,X5)).
% 9.66/1.63 cnf(a2, assumption,
% 9.66/1.63 X0 = X3).
% 9.66/1.63 cnf(a3, assumption,
% 9.66/1.63 X1 = X4).
% 9.66/1.63 cnf(a4, assumption,
% 9.66/1.63 X2 = X5).
% 9.66/1.63 cnf(c6, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 9.66/1.63 cnf(c7, plain,
% 9.66/1.63 X3 = X4 | X4 = X5,
% 9.66/1.63 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 9.66/1.63
% 9.66/1.63 cnf(c8, axiom,
% 9.66/1.63 sK9 != sK10).
% 9.66/1.63 cnf(a5, assumption,
% 9.66/1.63 sK10 = X4).
% 9.66/1.63 cnf(c9, plain,
% 9.66/1.63 X4 = X5,
% 9.66/1.63 inference(strict_subterm_extension, [assumptions([a5])], [c7, c8])).
% 9.66/1.63 cnf(c10, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(strict_subterm_extension, [assumptions([a5])], [c7, c8])).
% 9.66/1.63 cnf(c11, plain,
% 9.66/1.63 sK9 != X3,
% 9.66/1.63 inference(strict_subterm_extension, [assumptions([a5])], [c7, c8])).
% 9.66/1.63
% 9.66/1.63 cnf(a6, assumption,
% 9.66/1.63 sK9 = X3).
% 9.66/1.63 cnf(c12, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(reflexivity, [assumptions([a6])], [c11])).
% 9.66/1.63
% 9.66/1.63 cnf(c13, axiom,
% 9.66/1.63 sK9 != sK10).
% 9.66/1.63 cnf(a7, assumption,
% 9.66/1.63 sK10 = X4).
% 9.66/1.63 cnf(c14, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(strict_subterm_extension, [assumptions([a7])], [c9, c13])).
% 9.66/1.63 cnf(c15, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(strict_subterm_extension, [assumptions([a7])], [c9, c13])).
% 9.66/1.63 cnf(c16, plain,
% 9.66/1.63 sK9 != X5,
% 9.66/1.63 inference(strict_subterm_extension, [assumptions([a7])], [c9, c13])).
% 9.66/1.63
% 9.66/1.63 cnf(a8, assumption,
% 9.66/1.63 sK9 = X5).
% 9.66/1.63 cnf(c17, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(reflexivity, [assumptions([a8])], [c16])).
% 9.66/1.63
% 9.66/1.63 cnf(c18, plain,
% 9.66/1.63 $false,
% 9.66/1.63 inference(constraint_solving, [
% 9.66/1.63 bind(X0, sK9),
% 9.66/1.63 bind(X1, sK10),
% 9.66/1.63 bind(X2, sK9),
% 9.66/1.63 bind(X3, sK9),
% 9.66/1.63 bind(X4, sK10),
% 9.66/1.63 bind(X5, sK9)
% 9.66/1.63 ],
% 9.66/1.63 [a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 9.66/1.63
% 9.66/1.63 % SZS output end IncompleteProof
%------------------------------------------------------------------------------