TSTP Solution File: RNG119+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG119+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:03 EDT 2022
% Result : Theorem 7.39s 2.48s
% Output : CNFRefutation 7.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 32 RR)
% Number of literals : 59 ( 14 equ; 29 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_116,hypothesis,
sdtpldt0(sdtasdt0(xq,xu),xr) = xb,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_116) ).
cnf(i_0_119,negated_conjecture,
xr = sz00,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_119) ).
cnf(i_0_54,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_54) ).
cnf(i_0_99,hypothesis,
aIdeal0(xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_99) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_10) ).
cnf(i_0_26,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_26) ).
cnf(i_0_108,hypothesis,
aElementOf0(xu,xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_108) ).
cnf(i_0_6,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_6) ).
cnf(i_0_118,hypothesis,
aElement0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_118) ).
cnf(i_0_72,plain,
( doDivides0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_72) ).
cnf(i_0_13,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_13) ).
cnf(i_0_114,hypothesis,
~ doDivides0(xu,xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u_7zoyve/lgb.p',i_0_114) ).
cnf(c_0_132,hypothesis,
sdtpldt0(sdtasdt0(xq,xu),xr) = xb,
i_0_116 ).
cnf(c_0_133,negated_conjecture,
xr = sz00,
i_0_119 ).
cnf(c_0_134,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
i_0_54 ).
cnf(c_0_135,hypothesis,
aIdeal0(xI),
i_0_99 ).
cnf(c_0_136,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aElement0(X1) ),
i_0_10 ).
cnf(c_0_137,hypothesis,
sdtpldt0(sdtasdt0(xq,xu),sz00) = xb,
inference(rw,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_138,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_26 ).
cnf(c_0_139,hypothesis,
aElementOf0(xu,xI),
i_0_108 ).
cnf(c_0_140,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_141,plain,
( sdtasdt0(xq,xu) = xb
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_6 ).
cnf(c_0_143,hypothesis,
aElement0(xq),
i_0_118 ).
cnf(c_0_144,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_139]),c_0_140])]) ).
cnf(c_0_145,plain,
( doDivides0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aElement0(X3) ),
i_0_72 ).
cnf(c_0_146,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_13 ).
cnf(c_0_147,plain,
sdtasdt0(xq,xu) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143])]),c_0_144])]) ).
cnf(c_0_148,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_145]),c_0_142]) ).
cnf(c_0_149,plain,
sdtasdt0(xu,xq) = xb,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_144]),c_0_143])]) ).
cnf(c_0_150,hypothesis,
~ doDivides0(xu,xb),
i_0_114 ).
cnf(c_0_151,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_143]),c_0_144])]),c_0_150]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG119+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 05:48:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.39/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.39/2.48 # No SInE strategy applied
% 7.39/2.48 # Trying AutoSched0 for 150 seconds
% 7.39/2.48 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 7.39/2.48 # and selection function SelectNewComplexAHPNS.
% 7.39/2.48 #
% 7.39/2.48 # Preprocessing time : 0.021 s
% 7.39/2.48
% 7.39/2.48 # Proof found!
% 7.39/2.48 # SZS status Theorem
% 7.39/2.48 # SZS output start CNFRefutation
% See solution above
% 7.39/2.48 # Training examples: 0 positive, 0 negative
% 7.39/2.48
% 7.39/2.48 # -------------------------------------------------
% 7.39/2.48 # User time : 0.025 s
% 7.39/2.48 # System time : 0.007 s
% 7.39/2.48 # Total time : 0.032 s
% 7.39/2.48 # Maximum resident set size: 7128 pages
% 7.39/2.48
%------------------------------------------------------------------------------