%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG086+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:56 EDT 2022
% Result : Theorem 7.44s 2.34s
% Output : CNFRefutation 7.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 0 nHn; 26 RR)
% Number of literals : 71 ( 15 equ; 51 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
( aElementOf0(esk4_4(X1,X2,X3,X4),X2)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_37) ).
cnf(i_0_54,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_54) ).
cnf(i_0_55,hypothesis,
aIdeal0(xJ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_55) ).
cnf(i_0_60,negated_conjecture,
( sdtpldt0(X1,X2) != xx
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_60) ).
cnf(i_0_56,hypothesis,
aIdeal0(xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_56) ).
cnf(i_0_59,hypothesis,
aElementOf0(xx,sdtpldt1(xI,xJ)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_59) ).
cnf(i_0_38,plain,
( aElementOf0(esk3_4(X1,X2,X3,X4),X1)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_38) ).
cnf(i_0_36,plain,
( sdtpldt0(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)) = X4
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qmng8x6x/lgb.p',i_0_36) ).
cnf(c_0_69,plain,
( aElementOf0(esk4_4(X1,X2,X3,X4),X2)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X4,X3) ),
i_0_37 ).
cnf(c_0_70,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
i_0_54 ).
cnf(c_0_71,hypothesis,
aIdeal0(xJ),
i_0_55 ).
cnf(c_0_72,negated_conjecture,
( sdtpldt0(X1,X2) != xx
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI) ),
i_0_60 ).
cnf(c_0_73,plain,
( aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X3,sdtpldt1(X1,X2)) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_74,hypothesis,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_75,hypothesis,
aIdeal0(xI),
i_0_56 ).
cnf(c_0_76,negated_conjecture,
( sdtpldt0(X1,esk4_4(X2,xJ,sdtpldt1(X2,xJ),X3)) != xx
| ~ aSet0(X2)
| ~ aElementOf0(X3,sdtpldt1(X2,xJ))
| ~ aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_77,hypothesis,
aElementOf0(xx,sdtpldt1(xI,xJ)),
i_0_59 ).
cnf(c_0_78,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_70,c_0_75]) ).
cnf(c_0_79,plain,
( aElementOf0(esk3_4(X1,X2,X3,X4),X1)
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X4,X3) ),
i_0_38 ).
cnf(c_0_80,hypothesis,
( sdtpldt0(X1,esk4_4(xI,xJ,sdtpldt1(xI,xJ),xx)) != xx
| ~ aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78])]) ).
cnf(c_0_81,plain,
( aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X3,sdtpldt1(X1,X2)) ),
inference(er,[status(thm)],[c_0_79]) ).
cnf(c_0_82,plain,
( sdtpldt0(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)) = X4
| X3 != sdtpldt1(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X4,X3) ),
i_0_36 ).
cnf(c_0_83,plain,
( sdtpldt0(esk3_4(xI,X1,sdtpldt1(xI,X1),X2),esk4_4(xI,xJ,sdtpldt1(xI,xJ),xx)) != xx
| ~ aSet0(X1)
| ~ aElementOf0(X2,sdtpldt1(xI,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_78])]) ).
cnf(c_0_84,plain,
( sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3)) = X3
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X3,sdtpldt1(X1,X2)) ),
inference(er,[status(thm)],[c_0_82]) ).
cnf(c_0_85,hypothesis,
sdtpldt0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),xx),esk4_4(xI,xJ,sdtpldt1(xI,xJ),xx)) != xx,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_77]),c_0_74])]) ).
cnf(c_0_86,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_77]),c_0_74]),c_0_78])]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG086+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 10:41:28 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.44/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.44/2.34 # No SInE strategy applied
% 7.44/2.34 # Trying AutoSched0 for 150 seconds
% 7.44/2.34 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 7.44/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.44/2.34 #
% 7.44/2.34 # Preprocessing time : 0.023 s
% 7.44/2.34 # Presaturation interreduction done
% 7.44/2.34
% 7.44/2.34 # Proof found!
% 7.44/2.34 # SZS status Theorem
% 7.44/2.34 # SZS output start CNFRefutation
% See solution above
% 7.44/2.34 # Training examples: 0 positive, 0 negative
% 7.44/2.34
% 7.44/2.34 # -------------------------------------------------
% 7.44/2.34 # User time : 0.074 s
% 7.44/2.34 # System time : 0.007 s
% 7.44/2.34 # Total time : 0.080 s
% 7.44/2.34 # Maximum resident set size: 7128 pages
% 7.44/2.34
%------------------------------------------------------------------------------