TSTP Solution File: RNG089+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : RNG089+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 : n021.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 20:33:31 EDT 2022
% Result : Theorem 2.97s 0.73s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG089+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n021.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 : Mon May 30 18:00:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.97/0.73 % SZS status Theorem
% 2.97/0.73 % SZS output begin IncompleteProof
% 2.97/0.73 cnf(c0, axiom,
% 2.97/0.73 ~aElementOf0(sdtasdt0(xz,xl),xJ) | ~aElementOf0(sdtasdt0(xz,xk),xI)).
% 2.97/0.73 cnf(c1, plain,
% 2.97/0.73 ~aElementOf0(sdtasdt0(xz,xl),xJ) | ~aElementOf0(sdtasdt0(xz,xk),xI),
% 2.97/0.73 inference(start, [], [c0])).
% 2.97/0.73
% 2.97/0.73 cnf(c2, axiom,
% 2.97/0.73 aElementOf0(sdtasdt0(X0,X1),X2) | ~aElement0(X0) | ~sP10(X2,X1)).
% 2.97/0.73 cnf(a0, assumption,
% 2.97/0.73 sdtasdt0(xz,xl) = sdtasdt0(X0,X1)).
% 2.97/0.73 cnf(a1, assumption,
% 2.97/0.73 xJ = X2).
% 2.97/0.73 cnf(c3, plain,
% 2.97/0.73 ~aElementOf0(sdtasdt0(xz,xk),xI),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.97/0.73 cnf(c4, plain,
% 2.97/0.73 ~aElement0(X0) | ~sP10(X2,X1),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.97/0.73
% 2.97/0.73 cnf(c5, axiom,
% 2.97/0.73 aElement0(xz)).
% 2.97/0.73 cnf(a2, assumption,
% 2.97/0.73 X0 = xz).
% 2.97/0.73 cnf(c6, plain,
% 2.97/0.73 ~sP10(X2,X1),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 2.97/0.73 cnf(c7, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])).
% 2.97/0.73
% 2.97/0.73 cnf(c8, axiom,
% 2.97/0.73 sP10(X3,X4) | ~aElementOf0(X4,X3) | ~sP11(X3)).
% 2.97/0.73 cnf(a3, assumption,
% 2.97/0.73 X2 = X3).
% 2.97/0.73 cnf(a4, assumption,
% 2.97/0.73 X1 = X4).
% 2.97/0.73 cnf(c9, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 2.97/0.73 cnf(c10, plain,
% 2.97/0.73 ~aElementOf0(X4,X3) | ~sP11(X3),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 2.97/0.73
% 2.97/0.73 cnf(c11, axiom,
% 2.97/0.73 aElementOf0(xl,xJ)).
% 2.97/0.73 cnf(a5, assumption,
% 2.97/0.73 X4 = xl).
% 2.97/0.73 cnf(a6, assumption,
% 2.97/0.73 X3 = xJ).
% 2.97/0.73 cnf(c12, plain,
% 2.97/0.73 ~sP11(X3),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 2.97/0.73 cnf(c13, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 2.97/0.73
% 2.97/0.73 cnf(c14, axiom,
% 2.97/0.73 sP11(X5) | ~aIdeal0(X5)).
% 2.97/0.73 cnf(a7, assumption,
% 2.97/0.73 X3 = X5).
% 2.97/0.73 cnf(c15, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a7])], [c12, c14])).
% 2.97/0.73 cnf(c16, plain,
% 2.97/0.73 ~aIdeal0(X5),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a7])], [c12, c14])).
% 2.97/0.73
% 2.97/0.73 cnf(c17, axiom,
% 2.97/0.73 aIdeal0(xJ)).
% 2.97/0.73 cnf(a8, assumption,
% 2.97/0.73 X5 = xJ).
% 2.97/0.73 cnf(c18, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a8])], [c16, c17])).
% 2.97/0.73 cnf(c19, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a8])], [c16, c17])).
% 2.97/0.73
% 2.97/0.73 cnf(c20, axiom,
% 2.97/0.73 aElementOf0(sdtasdt0(X6,X7),X8) | ~aElement0(X6) | ~sP10(X8,X7)).
% 2.97/0.73 cnf(a9, assumption,
% 2.97/0.73 sdtasdt0(xz,xk) = sdtasdt0(X6,X7)).
% 2.97/0.73 cnf(a10, assumption,
% 2.97/0.73 xI = X8).
% 2.97/0.73 cnf(c21, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a9, a10])], [c3, c20])).
% 2.97/0.73 cnf(c22, plain,
% 2.97/0.73 ~aElement0(X6) | ~sP10(X8,X7),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a9, a10])], [c3, c20])).
% 2.97/0.73
% 2.97/0.73 cnf(c23, plain,
% 2.97/0.73 aElement0(X0)).
% 2.97/0.73 cnf(a11, assumption,
% 2.97/0.73 X6 = X0).
% 2.97/0.73 cnf(c24, plain,
% 2.97/0.73 ~sP10(X8,X7),
% 2.97/0.73 inference(predicate_reduction, [assumptions([a11])], [c22, c23])).
% 2.97/0.73
% 2.97/0.73 cnf(c25, axiom,
% 2.97/0.73 sP10(X9,X10) | ~aElementOf0(X10,X9) | ~sP11(X9)).
% 2.97/0.73 cnf(a12, assumption,
% 2.97/0.73 X8 = X9).
% 2.97/0.73 cnf(a13, assumption,
% 2.97/0.73 X7 = X10).
% 2.97/0.73 cnf(c26, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a12, a13])], [c24, c25])).
% 2.97/0.73 cnf(c27, plain,
% 2.97/0.73 ~aElementOf0(X10,X9) | ~sP11(X9),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a12, a13])], [c24, c25])).
% 2.97/0.73
% 2.97/0.73 cnf(c28, axiom,
% 2.97/0.73 aElementOf0(xk,xI)).
% 2.97/0.73 cnf(a14, assumption,
% 2.97/0.73 X10 = xk).
% 2.97/0.73 cnf(a15, assumption,
% 2.97/0.73 X9 = xI).
% 2.97/0.73 cnf(c29, plain,
% 2.97/0.73 ~sP11(X9),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a14, a15])], [c27, c28])).
% 2.97/0.73 cnf(c30, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a14, a15])], [c27, c28])).
% 2.97/0.73
% 2.97/0.73 cnf(c31, axiom,
% 2.97/0.73 sP11(X11) | ~aIdeal0(X11)).
% 2.97/0.73 cnf(a16, assumption,
% 2.97/0.73 X9 = X11).
% 2.97/0.73 cnf(c32, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a16])], [c29, c31])).
% 2.97/0.73 cnf(c33, plain,
% 2.97/0.73 ~aIdeal0(X11),
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a16])], [c29, c31])).
% 2.97/0.73
% 2.97/0.73 cnf(c34, axiom,
% 2.97/0.73 aIdeal0(xI)).
% 2.97/0.73 cnf(a17, assumption,
% 2.97/0.73 X11 = xI).
% 2.97/0.73 cnf(c35, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a17])], [c33, c34])).
% 2.97/0.73 cnf(c36, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(strict_predicate_extension, [assumptions([a17])], [c33, c34])).
% 2.97/0.73
% 2.97/0.73 cnf(c37, plain,
% 2.97/0.73 $false,
% 2.97/0.73 inference(constraint_solving, [
% 2.97/0.73 bind(X0, xz),
% 2.97/0.73 bind(X1, xl),
% 2.97/0.73 bind(X2, xJ),
% 2.97/0.73 bind(X3, xJ),
% 2.97/0.73 bind(X4, xl),
% 2.97/0.73 bind(X5, xJ),
% 2.97/0.73 bind(X6, xz),
% 2.97/0.73 bind(X7, xk),
% 2.97/0.73 bind(X8, xI),
% 2.97/0.73 bind(X9, xI),
% 2.97/0.73 bind(X10, xk),
% 2.97/0.73 bind(X11, xI)
% 2.97/0.73 ],
% 2.97/0.73 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 2.97/0.73
% 2.97/0.73 % SZS output end IncompleteProof
%------------------------------------------------------------------------------