TSTP Solution File: NUM551+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : NUM551+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 11:33:56 EDT 2022
% Result : Theorem 0.20s 0.41s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM551+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n027.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.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 09:00:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 % SZS output begin IncompleteProof
% 0.20/0.41 cnf(c0, axiom,
% 0.20/0.41 ~aElementOf0(X0,xQ) | ~aElement0(X0)).
% 0.20/0.41 cnf(c1, plain,
% 0.20/0.41 ~aElementOf0(X0,xQ) | ~aElement0(X0),
% 0.20/0.41 inference(start, [], [c0])).
% 0.20/0.41
% 0.20/0.41 cnf(c2, axiom,
% 0.20/0.41 slcrc0 = X1 | aElementOf0(sK24(X1),X1) | ~aSet0(X1)).
% 0.20/0.41 cnf(a0, assumption,
% 0.20/0.41 X0 = sK24(X1)).
% 0.20/0.41 cnf(a1, assumption,
% 0.20/0.41 xQ = X1).
% 0.20/0.41 cnf(c3, plain,
% 0.20/0.41 ~aElement0(X0),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.41 cnf(c4, plain,
% 0.20/0.41 slcrc0 = X1 | ~aSet0(X1),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.41
% 0.20/0.41 cnf(c5, axiom,
% 0.20/0.41 slcrc0 != xQ).
% 0.20/0.41 cnf(a2, assumption,
% 0.20/0.41 xQ = X1).
% 0.20/0.41 cnf(a3, assumption,
% 0.20/0.41 slcrc0 = X2).
% 0.20/0.41 cnf(c6, plain,
% 0.20/0.41 ~aSet0(X1),
% 0.20/0.41 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.41 cnf(c7, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.41 cnf(c8, plain,
% 0.20/0.41 slcrc0 != X2,
% 0.20/0.41 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.41
% 0.20/0.41 cnf(a4, assumption,
% 0.20/0.41 slcrc0 = X2).
% 0.20/0.41 cnf(c9, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(reflexivity, [assumptions([a4])], [c8])).
% 0.20/0.41
% 0.20/0.41 cnf(c10, axiom,
% 0.20/0.41 aSet0(xQ)).
% 0.20/0.41 cnf(a5, assumption,
% 0.20/0.41 X1 = xQ).
% 0.20/0.41 cnf(c11, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a5])], [c6, c10])).
% 0.20/0.41 cnf(c12, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a5])], [c6, c10])).
% 0.20/0.41
% 0.20/0.41 cnf(c13, axiom,
% 0.20/0.41 aElement0(X3) | ~aElementOf0(X3,X4) | ~aSet0(X4)).
% 0.20/0.41 cnf(a6, assumption,
% 0.20/0.41 X0 = X3).
% 0.20/0.41 cnf(c14, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a6])], [c3, c13])).
% 0.20/0.41 cnf(c15, plain,
% 0.20/0.41 ~aElementOf0(X3,X4) | ~aSet0(X4),
% 0.20/0.41 inference(strict_predicate_extension, [assumptions([a6])], [c3, c13])).
% 0.20/0.41
% 0.20/0.41 cnf(c16, plain,
% 0.20/0.41 aElementOf0(X0,xQ)).
% 0.20/0.41 cnf(a7, assumption,
% 0.20/0.41 X3 = X0).
% 0.20/0.41 cnf(a8, assumption,
% 0.20/0.41 X4 = xQ).
% 0.20/0.41 cnf(c17, plain,
% 0.20/0.41 ~aSet0(X4),
% 0.20/0.41 inference(predicate_reduction, [assumptions([a7, a8])], [c15, c16])).
% 0.20/0.41
% 0.20/0.41 cnf(c18, plain,
% 0.20/0.41 aSet0(X1)).
% 0.20/0.41 cnf(a9, assumption,
% 0.20/0.41 X4 = X1).
% 0.20/0.41 cnf(c19, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(predicate_reduction, [assumptions([a9])], [c17, c18])).
% 0.20/0.41
% 0.20/0.41 cnf(c20, plain,
% 0.20/0.41 $false,
% 0.20/0.41 inference(constraint_solving, [
% 0.20/0.41 bind(X0, sK24(X1)),
% 0.20/0.41 bind(X1, xQ),
% 0.20/0.41 bind(X2, slcrc0),
% 0.20/0.41 bind(X3, sK24(X1)),
% 0.20/0.41 bind(X4, xQ)
% 0.20/0.41 ],
% 0.20/0.41 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])).
% 0.20/0.41
% 0.20/0.41 % SZS output end IncompleteProof
%------------------------------------------------------------------------------