TSTP Solution File: SEU230+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n027.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 11:54:17 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n027.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 : Sat Jun 18 20:15:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Theorem
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 ~in(sK16,set_union2(sK16,singleton(sK16)))).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~in(sK16,set_union2(sK16,singleton(sK16))),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 in(X0,X1) | ~sP2(X2,X0,X3) | ~sP3(X3,X2,X1)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 sK16 = X0).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 set_union2(sK16,singleton(sK16)) = X1).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 ~sP2(X2,X0,X3) | ~sP3(X3,X2,X1),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 sP2(X4,X5,X6) | ~in(X5,X4)).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 X2 = X4).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 X0 = X5).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 X3 = X6).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~sP3(X3,X2,X1),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 ~in(X5,X4),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a2, a3, a4])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 in(X7,X8) | ~sP1(X7,X8)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X5 = X7).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.35 X4 = X8).
% 0.12/0.35 cnf(c9, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.12/0.35 cnf(c10, plain,
% 0.12/0.35 ~sP1(X7,X8),
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c7, c8])).
% 0.12/0.35
% 0.12/0.35 cnf(c11, axiom,
% 0.12/0.35 sP1(X9,singleton(X9))).
% 0.12/0.35 cnf(a7, assumption,
% 0.12/0.35 X7 = X9).
% 0.12/0.35 cnf(a8, assumption,
% 0.12/0.35 X8 = singleton(X9)).
% 0.12/0.35 cnf(c12, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.12/0.35 cnf(c13, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])).
% 0.12/0.35
% 0.12/0.35 cnf(c14, axiom,
% 0.12/0.35 sP3(X10,X11,set_union2(X10,X11))).
% 0.12/0.35 cnf(a9, assumption,
% 0.12/0.35 X3 = X10).
% 0.12/0.35 cnf(a10, assumption,
% 0.12/0.35 X2 = X11).
% 0.12/0.35 cnf(a11, assumption,
% 0.12/0.35 X1 = set_union2(X10,X11)).
% 0.12/0.35 cnf(c15, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c6, c14])).
% 0.12/0.35 cnf(c16, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c6, c14])).
% 0.12/0.35
% 0.12/0.35 cnf(c17, plain,
% 0.12/0.35 $false,
% 0.12/0.35 inference(constraint_solving, [
% 0.12/0.35 bind(X0, sK16),
% 0.12/0.35 bind(X1, set_union2(sK16,singleton(sK16))),
% 0.12/0.35 bind(X2, singleton(X9)),
% 0.12/0.35 bind(X3, sK16),
% 0.12/0.35 bind(X4, singleton(X9)),
% 0.12/0.35 bind(X5, sK16),
% 0.12/0.35 bind(X6, sK16),
% 0.12/0.35 bind(X7, sK16),
% 0.12/0.35 bind(X8, singleton(X9)),
% 0.12/0.35 bind(X9, sK16),
% 0.12/0.35 bind(X10, sK16),
% 0.12/0.35 bind(X11, singleton(X9))
% 0.12/0.35 ],
% 0.12/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])).
% 0.12/0.35
% 0.12/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------