TSTP Solution File: SET631+3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET631+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 : n009.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:47:15 EDT 2022
% Result : Theorem 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET631+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 23:52:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % SZS status Theorem
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 intersect(sK1,difference(sK2,sK3))).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 intersect(sK1,difference(sK2,sK3)),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 member(sK0(X0,X1),X0) | ~intersect(X0,X1)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 sK1 = X0).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 difference(sK2,sK3) = X1).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 member(sK0(X0,X1),X0),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 intersect(X2,X3) | ~member(X4,X3) | ~member(X4,X2)).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 sK0(X0,X1) = X4).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X0 = X2).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 intersect(X2,X3) | ~member(X4,X3),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 ~intersect(sK1,sK2)).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X2 = sK1).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X3 = sK2).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.36 ~member(X4,X3),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.36 cnf(c10, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.36
% 0.13/0.36 cnf(c11, axiom,
% 0.13/0.36 member(X5,X6) | ~member(X5,difference(X6,X7))).
% 0.13/0.36 cnf(a6, assumption,
% 0.13/0.36 X4 = X5).
% 0.13/0.36 cnf(a7, assumption,
% 0.13/0.36 X3 = X6).
% 0.13/0.36 cnf(c12, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.13/0.36 cnf(c13, plain,
% 0.13/0.36 ~member(X5,difference(X6,X7)),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c11])).
% 0.13/0.36
% 0.13/0.36 cnf(c14, axiom,
% 0.13/0.36 member(sK0(X8,X9),X9) | ~intersect(X8,X9)).
% 0.13/0.36 cnf(a8, assumption,
% 0.13/0.36 X5 = sK0(X8,X9)).
% 0.13/0.36 cnf(a9, assumption,
% 0.13/0.36 difference(X6,X7) = X9).
% 0.13/0.36 cnf(c15, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.13/0.36 cnf(c16, plain,
% 0.13/0.36 ~intersect(X8,X9),
% 0.13/0.36 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 0.13/0.36
% 0.13/0.36 cnf(c17, plain,
% 0.13/0.36 intersect(sK1,difference(sK2,sK3))).
% 0.13/0.36 cnf(a10, assumption,
% 0.13/0.36 X8 = sK1).
% 0.13/0.36 cnf(a11, assumption,
% 0.13/0.36 X9 = difference(sK2,sK3)).
% 0.13/0.36 cnf(c18, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(predicate_reduction, [assumptions([a10, a11])], [c16, c17])).
% 0.13/0.36
% 0.13/0.36 cnf(c19, plain,
% 0.13/0.36 $false,
% 0.13/0.36 inference(constraint_solving, [
% 0.13/0.36 bind(X0, sK1),
% 0.13/0.36 bind(X1, difference(sK2,sK3)),
% 0.13/0.36 bind(X2, sK1),
% 0.13/0.36 bind(X3, sK2),
% 0.13/0.36 bind(X4, sK0(X0,X1)),
% 0.13/0.36 bind(X5, sK0(X0,X1)),
% 0.13/0.36 bind(X6, sK2),
% 0.13/0.36 bind(X7, sK3),
% 0.13/0.36 bind(X8, sK1),
% 0.13/0.36 bind(X9, difference(sK2,sK3))
% 0.13/0.36 ],
% 0.13/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.13/0.36
% 0.13/0.36 % SZS output end IncompleteProof
%------------------------------------------------------------------------------