TSTP Solution File: SET185+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET185+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 : n003.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:32 EDT 2022
% Result : Theorem 10.11s 1.64s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET185+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.33 % Computer : n003.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 10:40:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 10.11/1.64 % SZS status Theorem
% 10.11/1.64 % SZS output begin IncompleteProof
% 10.11/1.64 cnf(c0, axiom,
% 10.11/1.64 subset(sK3,sK4)).
% 10.11/1.64 cnf(c1, plain,
% 10.11/1.64 subset(sK3,sK4),
% 10.11/1.64 inference(start, [], [c0])).
% 10.11/1.64
% 10.11/1.64 cnf(c2, axiom,
% 10.11/1.64 member(X0,X1) | ~member(X0,X2) | ~subset(X2,X1)).
% 10.11/1.64 cnf(a0, assumption,
% 10.11/1.64 sK3 = X2).
% 10.11/1.64 cnf(a1, assumption,
% 10.11/1.64 sK4 = X1).
% 10.11/1.64 cnf(c3, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 10.11/1.64 cnf(c4, plain,
% 10.11/1.64 member(X0,X1) | ~member(X0,X2),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 10.11/1.64
% 10.11/1.64 cnf(c5, axiom,
% 10.11/1.64 member(X3,union(X4,X5)) | ~member(X3,X5)).
% 10.11/1.64 cnf(a2, assumption,
% 10.11/1.64 X0 = X3).
% 10.11/1.64 cnf(a3, assumption,
% 10.11/1.64 X1 = X5).
% 10.11/1.64 cnf(c6, plain,
% 10.11/1.64 ~member(X0,X2),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 10.11/1.64 cnf(c7, plain,
% 10.11/1.64 member(X3,union(X4,X5)),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 10.11/1.64
% 10.11/1.64 cnf(c8, axiom,
% 10.11/1.64 sP0(X6,X7) | ~member(sK2(X6,X7),X6) | ~member(sK2(X6,X7),X7)).
% 10.11/1.64 cnf(a4, assumption,
% 10.11/1.64 X3 = sK2(X6,X7)).
% 10.11/1.64 cnf(a5, assumption,
% 10.11/1.64 union(X4,X5) = X7).
% 10.11/1.64 cnf(c9, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 10.11/1.64 cnf(c10, plain,
% 10.11/1.64 sP0(X6,X7) | ~member(sK2(X6,X7),X6),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 10.11/1.64
% 10.11/1.64 cnf(c11, axiom,
% 10.11/1.64 X8 = X9 | ~sP0(X9,X8)).
% 10.11/1.64 cnf(a6, assumption,
% 10.11/1.64 X6 = X9).
% 10.11/1.64 cnf(a7, assumption,
% 10.11/1.64 X7 = X8).
% 10.11/1.64 cnf(c12, plain,
% 10.11/1.64 ~member(sK2(X6,X7),X6),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 10.11/1.64 cnf(c13, plain,
% 10.11/1.64 X8 = X9,
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 10.11/1.64
% 10.11/1.64 cnf(c14, axiom,
% 10.11/1.64 sK4 != union(sK3,sK4)).
% 10.11/1.64 cnf(a8, assumption,
% 10.11/1.64 union(sK3,sK4) = X8).
% 10.11/1.64 cnf(c15, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(strict_subterm_extension, [assumptions([a8])], [c13, c14])).
% 10.11/1.64 cnf(c16, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(strict_subterm_extension, [assumptions([a8])], [c13, c14])).
% 10.11/1.64 cnf(c17, plain,
% 10.11/1.64 sK4 != X9,
% 10.11/1.64 inference(strict_subterm_extension, [assumptions([a8])], [c13, c14])).
% 10.11/1.64
% 10.11/1.64 cnf(a9, assumption,
% 10.11/1.64 sK4 = X9).
% 10.11/1.64 cnf(c18, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(reflexivity, [assumptions([a9])], [c17])).
% 10.11/1.64
% 10.11/1.64 cnf(c19, plain,
% 10.11/1.64 member(X0,X1)).
% 10.11/1.64 cnf(a10, assumption,
% 10.11/1.64 sK2(X6,X7) = X0).
% 10.11/1.64 cnf(a11, assumption,
% 10.11/1.64 X6 = X1).
% 10.11/1.64 cnf(c20, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(predicate_reduction, [assumptions([a10, a11])], [c12, c19])).
% 10.11/1.64
% 10.11/1.64 cnf(c21, axiom,
% 10.11/1.64 member(X10,X11) | member(X10,X12) | ~member(X10,union(X12,X11))).
% 10.11/1.64 cnf(a12, assumption,
% 10.11/1.64 X0 = X10).
% 10.11/1.64 cnf(a13, assumption,
% 10.11/1.64 X2 = X12).
% 10.11/1.64 cnf(c22, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c21])).
% 10.11/1.64 cnf(c23, plain,
% 10.11/1.64 member(X10,X11) | ~member(X10,union(X12,X11)),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c21])).
% 10.11/1.64
% 10.11/1.64 cnf(c24, plain,
% 10.11/1.64 ~member(X0,X1)).
% 10.11/1.64 cnf(a14, assumption,
% 10.11/1.64 X10 = X0).
% 10.11/1.64 cnf(a15, assumption,
% 10.11/1.64 X11 = X1).
% 10.11/1.64 cnf(c25, plain,
% 10.11/1.64 ~member(X10,union(X12,X11)),
% 10.11/1.64 inference(predicate_reduction, [assumptions([a14, a15])], [c23, c24])).
% 10.11/1.64
% 10.11/1.64 cnf(c26, axiom,
% 10.11/1.64 sP0(X13,X14) | member(sK2(X13,X14),X13) | member(sK2(X13,X14),X14)).
% 10.11/1.64 cnf(a16, assumption,
% 10.11/1.64 X10 = sK2(X13,X14)).
% 10.11/1.64 cnf(a17, assumption,
% 10.11/1.64 union(X12,X11) = X14).
% 10.11/1.64 cnf(c27, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])).
% 10.11/1.64 cnf(c28, plain,
% 10.11/1.64 sP0(X13,X14) | member(sK2(X13,X14),X13),
% 10.11/1.64 inference(strict_predicate_extension, [assumptions([a16, a17])], [c25, c26])).
% 10.11/1.64
% 10.11/1.64 cnf(c29, plain,
% 10.11/1.64 ~sP0(X6,X7)).
% 10.11/1.64 cnf(a18, assumption,
% 10.11/1.64 X13 = X6).
% 10.11/1.64 cnf(a19, assumption,
% 10.11/1.64 X14 = X7).
% 10.11/1.64 cnf(c30, plain,
% 10.11/1.64 member(sK2(X13,X14),X13),
% 10.11/1.64 inference(predicate_reduction, [assumptions([a18, a19])], [c28, c29])).
% 10.11/1.64
% 10.11/1.64 cnf(c31, plain,
% 10.11/1.64 ~member(X0,X1)).
% 10.11/1.64 cnf(a20, assumption,
% 10.11/1.64 sK2(X13,X14) = X0).
% 10.11/1.64 cnf(a21, assumption,
% 10.11/1.64 X13 = X1).
% 10.11/1.64 cnf(c32, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(predicate_reduction, [assumptions([a20, a21])], [c30, c31])).
% 10.11/1.64
% 10.11/1.64 cnf(c33, plain,
% 10.11/1.64 $false,
% 10.11/1.64 inference(constraint_solving, [
% 10.11/1.64 bind(X0, sK2(X6,X7)),
% 10.11/1.64 bind(X1, sK4),
% 10.11/1.64 bind(X2, sK3),
% 10.11/1.64 bind(X3, sK2(X6,X7)),
% 10.11/1.64 bind(X4, sK3),
% 10.11/1.64 bind(X5, sK4),
% 10.11/1.64 bind(X6, sK4),
% 10.11/1.64 bind(X7, union(X4,X5)),
% 10.11/1.64 bind(X8, union(X4,X5)),
% 10.11/1.64 bind(X9, sK4),
% 10.11/1.64 bind(X10, sK2(X6,X7)),
% 10.11/1.64 bind(X11, sK4),
% 10.11/1.64 bind(X12, sK3),
% 10.11/1.64 bind(X13, sK4),
% 10.11/1.64 bind(X14, union(X4,X5))
% 10.11/1.64 ],
% 10.11/1.64 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 10.11/1.64
% 10.11/1.64 % SZS output end IncompleteProof
%------------------------------------------------------------------------------