TSTP Solution File: RNG109+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG109+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:25:01 EDT 2022
% Result : Theorem 9.21s 2.61s
% Output : CNFRefutation 9.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 16 unt; 0 nHn; 26 RR)
% Number of literals : 41 ( 19 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_163,negated_conjecture,
( X1 = sz00
| sdtpldt0(X2,X3) != X1
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_163) ).
cnf(i_0_150,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_150) ).
cnf(i_0_159,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_159) ).
cnf(i_0_156,hypothesis,
aElementOf0(xa,slsdtgt0(xa)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_156) ).
cnf(i_0_9,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_9) ).
cnf(i_0_94,hypothesis,
aElement0(xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_94) ).
cnf(i_0_96,hypothesis,
( sz00 != xa
| sz00 != xb ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_96) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_10) ).
cnf(i_0_95,hypothesis,
aElement0(xa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vcngfu1t/lgb.p',i_0_95) ).
cnf(c_0_173,negated_conjecture,
( X1 = sz00
| sdtpldt0(X2,X3) != X1
| ~ aElementOf0(X3,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa)) ),
i_0_163 ).
cnf(c_0_174,negated_conjecture,
( sdtpldt0(X1,X2) = sz00
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(er,[status(thm)],[c_0_173]) ).
cnf(c_0_175,hypothesis,
aElementOf0(xb,slsdtgt0(xb)),
i_0_150 ).
cnf(c_0_176,hypothesis,
( sdtpldt0(X1,xb) = sz00
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(spm,[status(thm)],[c_0_174,c_0_175]) ).
cnf(c_0_177,hypothesis,
aElementOf0(sz00,slsdtgt0(xa)),
i_0_159 ).
cnf(c_0_178,hypothesis,
aElementOf0(xa,slsdtgt0(xa)),
i_0_156 ).
cnf(c_0_179,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aElement0(X1) ),
i_0_9 ).
cnf(c_0_180,hypothesis,
sdtpldt0(sz00,xb) = sz00,
inference(spm,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_181,hypothesis,
aElement0(xb),
i_0_94 ).
cnf(c_0_182,hypothesis,
sdtpldt0(xa,xb) = sz00,
inference(spm,[status(thm)],[c_0_176,c_0_178]) ).
cnf(c_0_183,plain,
xb = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_181])]) ).
cnf(c_0_184,hypothesis,
( sz00 != xa
| sz00 != xb ),
i_0_96 ).
cnf(c_0_185,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
i_0_10 ).
cnf(c_0_186,hypothesis,
sdtpldt0(xa,sz00) = sz00,
inference(rw,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_187,hypothesis,
aElement0(xa),
i_0_95 ).
cnf(c_0_188,hypothesis,
xa != sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_184,c_0_183])]) ).
cnf(c_0_189,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_186]),c_0_187])]),c_0_188]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG109+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.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 16:41:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 9.21/2.61 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.21/2.61 # No SInE strategy applied
% 9.21/2.61 # Trying AutoSched0 for 150 seconds
% 9.21/2.61 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 9.21/2.61 # and selection function SelectNewComplexAHPNS.
% 9.21/2.61 #
% 9.21/2.61 # Preprocessing time : 0.025 s
% 9.21/2.61
% 9.21/2.61 # Proof found!
% 9.21/2.61 # SZS status Theorem
% 9.21/2.61 # SZS output start CNFRefutation
% See solution above
% 9.21/2.61 # Training examples: 0 positive, 0 negative
% 9.21/2.61
% 9.21/2.61 # -------------------------------------------------
% 9.21/2.61 # User time : 0.038 s
% 9.21/2.61 # System time : 0.003 s
% 9.21/2.61 # Total time : 0.041 s
% 9.21/2.61 # Maximum resident set size: 7124 pages
% 9.21/2.61
%------------------------------------------------------------------------------