TSTP Solution File: RNG091+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG091+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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:24:57 EDT 2022
% Result : Theorem 4.48s 2.26s
% Output : CNFRefutation 4.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 21 unt; 0 nHn; 30 RR)
% Number of literals : 54 ( 8 equ; 27 neg)
% Maximal clause size : 7 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( aElementOf0(X1,X2)
| X2 != sdtpldt1(X3,X4)
| sdtpldt0(X5,X6) != X1
| ~ aSet0(X4)
| ~ aSet0(X3)
| ~ aElementOf0(X6,X4)
| ~ aElementOf0(X5,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_35) ).
cnf(i_0_54,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_54) ).
cnf(i_0_55,hypothesis,
aIdeal0(xJ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_55) ).
cnf(i_0_68,hypothesis,
aElementOf0(sdtasdt0(xz,xl),xJ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_68) ).
cnf(i_0_56,hypothesis,
aIdeal0(xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_56) ).
cnf(i_0_69,hypothesis,
aElementOf0(sdtasdt0(xz,xk),xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_69) ).
cnf(i_0_71,hypothesis,
sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)) = sdtasdt0(xz,xx),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_71) ).
cnf(i_0_66,hypothesis,
aElementOf0(sdtpldt0(xl,xn),xJ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_66) ).
cnf(i_0_72,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
| ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_72) ).
cnf(i_0_67,hypothesis,
aElementOf0(sdtpldt0(xk,xm),xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_67) ).
cnf(i_0_70,hypothesis,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) = sdtpldt0(xx,xy),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i9b2qer4/lgb.p',i_0_70) ).
cnf(c_0_84,plain,
( aElementOf0(X1,X2)
| X2 != sdtpldt1(X3,X4)
| sdtpldt0(X5,X6) != X1
| ~ aSet0(X4)
| ~ aSet0(X3)
| ~ aElementOf0(X6,X4)
| ~ aElementOf0(X5,X3) ),
i_0_35 ).
cnf(c_0_85,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
i_0_54 ).
cnf(c_0_86,hypothesis,
aIdeal0(xJ),
i_0_55 ).
cnf(c_0_87,plain,
( aElementOf0(sdtpldt0(X1,X2),sdtpldt1(X3,X4))
| ~ aSet0(X4)
| ~ aSet0(X3)
| ~ aElementOf0(X2,X4)
| ~ aElementOf0(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_84])]) ).
cnf(c_0_88,hypothesis,
aElementOf0(sdtasdt0(xz,xl),xJ),
i_0_68 ).
cnf(c_0_89,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,hypothesis,
aIdeal0(xI),
i_0_56 ).
cnf(c_0_91,hypothesis,
( aElementOf0(sdtpldt0(X1,sdtasdt0(xz,xl)),sdtpldt1(X2,xJ))
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).
cnf(c_0_92,hypothesis,
aElementOf0(sdtasdt0(xz,xk),xI),
i_0_69 ).
cnf(c_0_93,hypothesis,
sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)) = sdtasdt0(xz,xx),
i_0_71 ).
cnf(c_0_94,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_85,c_0_90]) ).
cnf(c_0_95,hypothesis,
aElementOf0(sdtpldt0(xl,xn),xJ),
i_0_66 ).
cnf(c_0_96,negated_conjecture,
( ~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ))
| ~ aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)) ),
i_0_72 ).
cnf(c_0_97,hypothesis,
aElementOf0(sdtasdt0(xz,xx),sdtpldt1(xI,xJ)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_94])]) ).
cnf(c_0_98,hypothesis,
( aElementOf0(sdtpldt0(X1,sdtpldt0(xl,xn)),sdtpldt1(X2,xJ))
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_95]),c_0_89])]) ).
cnf(c_0_99,hypothesis,
aElementOf0(sdtpldt0(xk,xm),xI),
i_0_67 ).
cnf(c_0_100,hypothesis,
sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) = sdtpldt0(xx,xy),
i_0_70 ).
cnf(c_0_101,negated_conjecture,
~ aElementOf0(sdtpldt0(xx,xy),sdtpldt1(xI,xJ)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]) ).
cnf(c_0_102,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_94])]),c_0_101]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG091+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.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 20:38:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 4.48/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.48/2.26 # No SInE strategy applied
% 4.48/2.26 # Trying AutoSched0 for 150 seconds
% 4.48/2.26 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 4.48/2.26 # and selection function SelectNewComplexAHP.
% 4.48/2.26 #
% 4.48/2.26 # Preprocessing time : 0.024 s
% 4.48/2.26 # Presaturation interreduction done
% 4.48/2.26
% 4.48/2.26 # Proof found!
% 4.48/2.26 # SZS status Theorem
% 4.48/2.26 # SZS output start CNFRefutation
% See solution above
% 4.48/2.26 # Training examples: 0 positive, 0 negative
% 4.48/2.26
% 4.48/2.26 # -------------------------------------------------
% 4.48/2.26 # User time : 0.095 s
% 4.48/2.26 # System time : 0.013 s
% 4.48/2.26 # Total time : 0.107 s
% 4.48/2.26 # Maximum resident set size: 7124 pages
% 4.48/2.26
%------------------------------------------------------------------------------