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