TSTP Solution File: RNG095+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG095+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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:24:58 EDT 2022
% Result : Theorem 12.22s 3.01s
% Output : CNFRefutation 12.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 13 unt; 0 nHn; 28 RR)
% Number of literals : 69 ( 12 equ; 43 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-0i6qpv0u/input.p',i_0_36) ).
cnf(i_0_61,hypothesis,
( aElementOf0(X1,sdtpldt1(xI,xJ))
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i6qpv0u/input.p',i_0_61) ).
cnf(i_0_3,plain,
aElement0(sz10),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i6qpv0u/input.p',i_0_3) ).
cnf(i_0_54,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i6qpv0u/input.p',i_0_54) ).
cnf(i_0_59,hypothesis,
aIdeal0(xJ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i6qpv0u/input.p',i_0_59) ).
cnf(i_0_60,hypothesis,
aIdeal0(xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i6qpv0u/input.p',i_0_60) ).
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-0i6qpv0u/input.p',i_0_37) ).
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-0i6qpv0u/input.p',i_0_38) ).
cnf(i_0_64,negated_conjecture,
( sdtpldt0(X1,X2) != sz10
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i6qpv0u/input.p',i_0_64) ).
cnf(c_0_74,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_75,hypothesis,
( aElementOf0(X1,sdtpldt1(xI,xJ))
| ~ aElement0(X1) ),
i_0_61 ).
cnf(c_0_76,plain,
aElement0(sz10),
i_0_3 ).
cnf(c_0_77,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
i_0_54 ).
cnf(c_0_78,hypothesis,
aIdeal0(xJ),
i_0_59 ).
cnf(c_0_79,hypothesis,
aIdeal0(xI),
i_0_60 ).
cnf(c_0_80,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_81,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_82,plain,
( sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3)) = X3
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_83,plain,
aElementOf0(sz10,sdtpldt1(xI,xJ)),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,plain,
aSet0(xJ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_77,c_0_79]) ).
cnf(c_0_86,plain,
( aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_80]) ).
cnf(c_0_87,plain,
( aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1)
| ~ aElementOf0(X3,sdtpldt1(X1,X2))
| ~ aSet0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_88,negated_conjecture,
( sdtpldt0(X1,X2) != sz10
| ~ aElementOf0(X2,xJ)
| ~ aElementOf0(X1,xI) ),
i_0_64 ).
cnf(c_0_89,plain,
sdtpldt0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),sz10),esk4_4(xI,xJ,sdtpldt1(xI,xJ),sz10)) = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_85])]) ).
cnf(c_0_90,plain,
aElementOf0(esk4_4(xI,xJ,sdtpldt1(xI,xJ),sz10),xJ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_83]),c_0_84]),c_0_85])]) ).
cnf(c_0_91,plain,
aElementOf0(esk3_4(xI,xJ,sdtpldt1(xI,xJ),sz10),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_83]),c_0_84]),c_0_85])]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : RNG095+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 : n026.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 14:09:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 12.22/3.01 # ENIGMATIC: Solved by autoschedule:
% 12.22/3.01 # No SInE strategy applied
% 12.22/3.01 # Trying AutoSched0 for 150 seconds
% 12.22/3.01 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 12.22/3.01 # and selection function SelectCQArNTNpEqFirst.
% 12.22/3.01 #
% 12.22/3.01 # Preprocessing time : 0.025 s
% 12.22/3.01 # Presaturation interreduction done
% 12.22/3.01
% 12.22/3.01 # Proof found!
% 12.22/3.01 # SZS status Theorem
% 12.22/3.01 # SZS output start CNFRefutation
% See solution above
% 12.22/3.01 # Training examples: 0 positive, 0 negative
% 12.22/3.01
% 12.22/3.01 # -------------------------------------------------
% 12.22/3.01 # User time : 0.629 s
% 12.22/3.01 # System time : 0.039 s
% 12.22/3.01 # Total time : 0.668 s
% 12.22/3.01 # Maximum resident set size: 7124 pages
% 12.22/3.01
%------------------------------------------------------------------------------