TSTP Solution File: SET162+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET162+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 : n010.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:44:21 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET162+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34 % Computer : n010.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 Jul 11 02:38:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 % SZS output begin IncompleteProof
% 0.12/0.40 cnf(c0, axiom,
% 0.12/0.40 sK4 != union(sK4,empty_set)).
% 0.12/0.40 cnf(c1, plain,
% 0.12/0.40 sK4 != union(sK4,empty_set),
% 0.12/0.40 inference(start, [], [c0])).
% 0.12/0.40
% 0.12/0.40 cnf(c2, axiom,
% 0.12/0.40 X0 = X1 | ~sP0(X1,X0)).
% 0.12/0.40 cnf(a0, assumption,
% 0.12/0.40 union(sK4,empty_set) = X0).
% 0.12/0.40 cnf(c3, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.40 cnf(c4, plain,
% 0.12/0.40 ~sP0(X1,X0),
% 0.12/0.40 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.40 cnf(c5, plain,
% 0.12/0.40 X1 != X2 | sK4 != X2,
% 0.12/0.40 inference(variable_extension, [assumptions([a0])], [c1, c2])).
% 0.12/0.40
% 0.12/0.40 cnf(a1, assumption,
% 0.12/0.40 X1 = X2).
% 0.12/0.40 cnf(c6, plain,
% 0.12/0.40 sK4 != X2,
% 0.12/0.40 inference(reflexivity, [assumptions([a1])], [c5])).
% 0.12/0.40
% 0.12/0.40 cnf(a2, assumption,
% 0.12/0.40 sK4 = X2).
% 0.12/0.40 cnf(c7, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(reflexivity, [assumptions([a2])], [c6])).
% 0.12/0.40
% 0.12/0.40 cnf(c8, axiom,
% 0.12/0.40 sP0(X3,X4) | ~member(sK3(X3,X4),X3) | ~member(sK3(X3,X4),X4)).
% 0.12/0.40 cnf(a3, assumption,
% 0.12/0.40 X1 = X3).
% 0.12/0.40 cnf(a4, assumption,
% 0.12/0.40 X0 = X4).
% 0.12/0.40 cnf(c9, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.12/0.40 cnf(c10, plain,
% 0.12/0.40 ~member(sK3(X3,X4),X3) | ~member(sK3(X3,X4),X4),
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 0.12/0.40
% 0.12/0.40 cnf(c11, axiom,
% 0.12/0.40 sP0(X5,X6) | member(sK3(X5,X6),X5) | member(sK3(X5,X6),X6)).
% 0.12/0.40 cnf(a5, assumption,
% 0.12/0.40 sK3(X3,X4) = sK3(X5,X6)).
% 0.12/0.40 cnf(a6, assumption,
% 0.12/0.40 X3 = X5).
% 0.12/0.40 cnf(c12, plain,
% 0.12/0.40 ~member(sK3(X3,X4),X4),
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.12/0.40 cnf(c13, plain,
% 0.12/0.40 sP0(X5,X6) | member(sK3(X5,X6),X6),
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 0.12/0.40
% 0.12/0.40 cnf(c14, plain,
% 0.12/0.40 ~sP0(X1,X0)).
% 0.12/0.40 cnf(a7, assumption,
% 0.12/0.40 X5 = X1).
% 0.12/0.40 cnf(a8, assumption,
% 0.12/0.40 X6 = X0).
% 0.12/0.40 cnf(c15, plain,
% 0.12/0.40 member(sK3(X5,X6),X6),
% 0.12/0.40 inference(predicate_reduction, [assumptions([a7, a8])], [c13, c14])).
% 0.12/0.40
% 0.12/0.40 cnf(c16, axiom,
% 0.12/0.40 member(X7,X8) | member(X7,X9) | ~member(X7,union(X9,X8))).
% 0.12/0.40 cnf(a9, assumption,
% 0.12/0.40 sK3(X5,X6) = X7).
% 0.12/0.40 cnf(a10, assumption,
% 0.12/0.40 X6 = union(X9,X8)).
% 0.12/0.40 cnf(c17, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 0.12/0.40 cnf(c18, plain,
% 0.12/0.40 member(X7,X8) | member(X7,X9),
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 0.12/0.40
% 0.12/0.40 cnf(c19, axiom,
% 0.12/0.40 ~member(X10,empty_set)).
% 0.12/0.40 cnf(a11, assumption,
% 0.12/0.40 X7 = X10).
% 0.12/0.40 cnf(a12, assumption,
% 0.12/0.40 X8 = empty_set).
% 0.12/0.40 cnf(c20, plain,
% 0.12/0.40 member(X7,X9),
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 0.12/0.40 cnf(c21, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 0.12/0.40
% 0.12/0.40 cnf(c22, plain,
% 0.12/0.40 ~member(sK3(X3,X4),X3)).
% 0.12/0.40 cnf(a13, assumption,
% 0.12/0.40 X7 = sK3(X3,X4)).
% 0.12/0.40 cnf(a14, assumption,
% 0.12/0.40 X9 = X3).
% 0.12/0.40 cnf(c23, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(predicate_reduction, [assumptions([a13, a14])], [c20, c22])).
% 0.12/0.40
% 0.12/0.40 cnf(c24, axiom,
% 0.12/0.40 member(X11,union(X12,X13)) | ~member(X11,X12)).
% 0.12/0.40 cnf(a15, assumption,
% 0.12/0.40 sK3(X3,X4) = X11).
% 0.12/0.40 cnf(a16, assumption,
% 0.12/0.40 X4 = union(X12,X13)).
% 0.12/0.40 cnf(c25, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a15, a16])], [c12, c24])).
% 0.12/0.40 cnf(c26, plain,
% 0.12/0.40 ~member(X11,X12),
% 0.12/0.40 inference(strict_predicate_extension, [assumptions([a15, a16])], [c12, c24])).
% 0.12/0.40
% 0.12/0.40 cnf(c27, plain,
% 0.12/0.40 member(sK3(X3,X4),X3)).
% 0.12/0.40 cnf(a17, assumption,
% 0.12/0.40 X11 = sK3(X3,X4)).
% 0.12/0.40 cnf(a18, assumption,
% 0.12/0.40 X12 = X3).
% 0.12/0.40 cnf(c28, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(predicate_reduction, [assumptions([a17, a18])], [c26, c27])).
% 0.12/0.40
% 0.12/0.40 cnf(c29, plain,
% 0.12/0.40 $false,
% 0.12/0.40 inference(constraint_solving, [
% 0.12/0.40 bind(X0, union(sK4,empty_set)),
% 0.12/0.40 bind(X1, sK4),
% 0.12/0.40 bind(X2, sK4),
% 0.12/0.40 bind(X3, sK4),
% 0.12/0.40 bind(X4, union(sK4,empty_set)),
% 0.12/0.40 bind(X5, sK4),
% 0.12/0.40 bind(X6, union(sK4,empty_set)),
% 0.12/0.40 bind(X7, sK3(X5,X6)),
% 0.12/0.40 bind(X8, empty_set),
% 0.12/0.40 bind(X9, sK4),
% 0.12/0.40 bind(X10, sK3(X5,X6)),
% 0.12/0.40 bind(X11, sK3(X3,X4)),
% 0.12/0.40 bind(X12, sK4),
% 0.12/0.40 bind(X13, empty_set)
% 0.12/0.40 ],
% 0.12/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 0.12/0.40
% 0.12/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------