TSTP Solution File: RNG123+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : RNG123+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 : n026.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:35 EDT 2022
% Result : Theorem 5.34s 1.13s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG123+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n026.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 : Mon May 30 13:54:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 5.34/1.13 % SZS status Theorem
% 5.34/1.13 % SZS output begin IncompleteProof
% 5.34/1.13 cnf(c0, axiom,
% 5.34/1.13 ~aElementOf0(xr,xI)).
% 5.34/1.13 cnf(c1, plain,
% 5.34/1.13 ~aElementOf0(xr,xI),
% 5.34/1.13 inference(start, [], [c0])).
% 5.34/1.13
% 5.34/1.13 cnf(c2, axiom,
% 5.34/1.13 aElementOf0(sdtpldt0(X0,X1),X2) | ~aElementOf0(X1,X2) | ~sP9(X2,X0)).
% 5.34/1.13 cnf(a0, assumption,
% 5.34/1.13 X3 = xr).
% 5.34/1.13 cnf(a1, assumption,
% 5.34/1.13 X4 = xI).
% 5.34/1.13 cnf(c3, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.34/1.13 cnf(c4, plain,
% 5.34/1.13 ~aElementOf0(X1,X2) | ~sP9(X2,X0),
% 5.34/1.13 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.34/1.13 cnf(c5, plain,
% 5.34/1.13 sdtpldt0(X0,X1) != X3 | X2 != X4,
% 5.34/1.13 inference(lazy_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 5.34/1.13
% 5.34/1.13 cnf(c6, axiom,
% 5.34/1.13 xr = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)).
% 5.34/1.13 cnf(a2, assumption,
% 5.34/1.13 sdtpldt0(X0,X1) = sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb)).
% 5.34/1.13 cnf(c7, plain,
% 5.34/1.13 X2 != X4,
% 5.34/1.13 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 5.34/1.13 cnf(c8, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 5.34/1.13 cnf(c9, plain,
% 5.34/1.13 X5 != xr | X5 != X3,
% 5.34/1.13 inference(strict_function_extension, [assumptions([a2])], [c5, c6])).
% 5.34/1.13
% 5.34/1.13 cnf(a3, assumption,
% 5.34/1.13 X5 = xr).
% 5.34/1.13 cnf(c10, plain,
% 5.34/1.13 X5 != X3,
% 5.34/1.13 inference(reflexivity, [assumptions([a3])], [c9])).
% 5.34/1.13
% 5.34/1.13 cnf(a4, assumption,
% 5.34/1.13 X5 = X3).
% 5.34/1.13 cnf(c11, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(reflexivity, [assumptions([a4])], [c10])).
% 5.34/1.13
% 5.34/1.13 cnf(a5, assumption,
% 5.34/1.13 X2 = X4).
% 5.34/1.13 cnf(c12, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(reflexivity, [assumptions([a5])], [c7])).
% 5.34/1.13
% 5.34/1.13 cnf(c13, axiom,
% 5.34/1.13 aElementOf0(xb,xI)).
% 5.34/1.13 cnf(a6, assumption,
% 5.34/1.13 X1 = xb).
% 5.34/1.13 cnf(a7, assumption,
% 5.34/1.13 X2 = xI).
% 5.34/1.13 cnf(c14, plain,
% 5.34/1.13 ~sP9(X2,X0),
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c13])).
% 5.34/1.13 cnf(c15, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a6, a7])], [c4, c13])).
% 5.34/1.13
% 5.34/1.13 cnf(c16, axiom,
% 5.34/1.13 sP9(X6,X7) | ~sP10(X6,X7)).
% 5.34/1.13 cnf(a8, assumption,
% 5.34/1.13 X2 = X6).
% 5.34/1.13 cnf(a9, assumption,
% 5.34/1.13 X0 = X7).
% 5.34/1.13 cnf(c17, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c16])).
% 5.34/1.13 cnf(c18, plain,
% 5.34/1.13 ~sP10(X6,X7),
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a8, a9])], [c14, c16])).
% 5.34/1.13
% 5.34/1.13 cnf(c19, axiom,
% 5.34/1.13 sP10(X8,X9) | ~aElementOf0(X9,X8) | ~sP11(X8)).
% 5.34/1.13 cnf(a10, assumption,
% 5.34/1.13 X6 = X8).
% 5.34/1.13 cnf(a11, assumption,
% 5.34/1.13 X7 = X9).
% 5.34/1.13 cnf(c20, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c19])).
% 5.34/1.13 cnf(c21, plain,
% 5.34/1.13 ~aElementOf0(X9,X8) | ~sP11(X8),
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c19])).
% 5.34/1.13
% 5.34/1.13 cnf(c22, axiom,
% 5.34/1.13 aElementOf0(smndt0(sdtasdt0(xq,xu)),xI)).
% 5.34/1.13 cnf(a12, assumption,
% 5.34/1.13 X9 = smndt0(sdtasdt0(xq,xu))).
% 5.34/1.13 cnf(a13, assumption,
% 5.34/1.13 X8 = xI).
% 5.34/1.13 cnf(c23, plain,
% 5.34/1.13 ~sP11(X8),
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a12, a13])], [c21, c22])).
% 5.34/1.13 cnf(c24, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a12, a13])], [c21, c22])).
% 5.34/1.13
% 5.34/1.13 cnf(c25, axiom,
% 5.34/1.13 sP11(X10) | ~aIdeal0(X10)).
% 5.34/1.13 cnf(a14, assumption,
% 5.34/1.13 X8 = X10).
% 5.34/1.13 cnf(c26, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a14])], [c23, c25])).
% 5.34/1.13 cnf(c27, plain,
% 5.34/1.13 ~aIdeal0(X10),
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a14])], [c23, c25])).
% 5.34/1.13
% 5.34/1.13 cnf(c28, axiom,
% 5.34/1.13 aIdeal0(xI)).
% 5.34/1.13 cnf(a15, assumption,
% 5.34/1.13 X10 = xI).
% 5.34/1.13 cnf(c29, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a15])], [c27, c28])).
% 5.34/1.13 cnf(c30, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(strict_predicate_extension, [assumptions([a15])], [c27, c28])).
% 5.34/1.13
% 5.34/1.13 cnf(c31, plain,
% 5.34/1.13 $false,
% 5.34/1.13 inference(constraint_solving, [
% 5.34/1.13 bind(X0, smndt0(sdtasdt0(xq,xu))),
% 5.34/1.13 bind(X1, xb),
% 5.34/1.13 bind(X2, xI),
% 5.34/1.13 bind(X3, xr),
% 5.34/1.13 bind(X4, xI),
% 5.34/1.13 bind(X5, xr),
% 5.34/1.13 bind(X6, xI),
% 5.34/1.13 bind(X7, smndt0(sdtasdt0(xq,xu))),
% 5.34/1.13 bind(X8, xI),
% 5.34/1.13 bind(X9, smndt0(sdtasdt0(xq,xu))),
% 5.34/1.13 bind(X10, xI)
% 5.34/1.13 ],
% 5.34/1.13 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15])).
% 5.34/1.13
% 5.34/1.13 % SZS output end IncompleteProof
%------------------------------------------------------------------------------