TSTP Solution File: RNG059+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG059+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:50 EDT 2022
% Result : Theorem 7.43s 2.34s
% Output : CNFRefutation 7.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 20 unt; 0 nHn; 30 RR)
% Number of literals : 50 ( 13 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( aScalar0(smndt0(X1))
| ~ aScalar0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_14) ).
cnf(i_0_31,plain,
( smndt0(sdtasdt0(X1,X2)) = sdtasdt0(X1,smndt0(X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_31) ).
cnf(i_0_13,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_13) ).
cnf(i_0_90,hypothesis,
sdtasdt0(xF,xD) = xS,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_90) ).
cnf(i_0_77,hypothesis,
aScalar0(xD),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_77) ).
cnf(i_0_81,hypothesis,
aScalar0(xF),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_81) ).
cnf(i_0_23,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_23) ).
cnf(i_0_11,plain,
aScalar0(sz0z00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_11) ).
cnf(i_0_92,hypothesis,
sdtasdt0(xR,xS) = xN,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_92) ).
cnf(i_0_91,hypothesis,
aScalar0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_91) ).
cnf(i_0_87,hypothesis,
aScalar0(xR),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_87) ).
cnf(i_0_96,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o1xo_n70/lgb.p',i_0_96) ).
cnf(c_0_109,plain,
( aScalar0(smndt0(X1))
| ~ aScalar0(X1) ),
i_0_14 ).
cnf(c_0_110,plain,
( smndt0(sdtasdt0(X1,X2)) = sdtasdt0(X1,smndt0(X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
i_0_31 ).
cnf(c_0_111,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
i_0_13 ).
cnf(c_0_112,hypothesis,
sdtasdt0(xF,xD) = xS,
i_0_90 ).
cnf(c_0_113,hypothesis,
aScalar0(xD),
i_0_77 ).
cnf(c_0_114,hypothesis,
aScalar0(xF),
i_0_81 ).
cnf(c_0_115,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
i_0_23 ).
cnf(c_0_116,plain,
aScalar0(sz0z00),
i_0_11 ).
cnf(c_0_117,hypothesis,
sdtasdt0(xR,xS) = xN,
i_0_92 ).
cnf(c_0_118,hypothesis,
aScalar0(xS),
i_0_91 ).
cnf(c_0_119,hypothesis,
aScalar0(xR),
i_0_87 ).
cnf(c_0_120,plain,
( aScalar0(sdtasdt0(X1,smndt0(X2)))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_121,hypothesis,
sdtasdt0(xF,smndt0(xD)) = smndt0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_112]),c_0_113]),c_0_114])]) ).
cnf(c_0_122,negated_conjecture,
sdtasdt0(smndt0(xS),xR) != smndt0(xN),
i_0_96 ).
cnf(c_0_123,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_124,hypothesis,
sdtasdt0(xR,smndt0(xS)) = smndt0(xN),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_117]),c_0_118]),c_0_119])]) ).
cnf(c_0_125,plain,
aScalar0(smndt0(xS)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_113]),c_0_114])]) ).
cnf(c_0_126,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]),c_0_125]),c_0_119])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG059+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n027.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 13:01:48 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.43/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.43/2.34 # No SInE strategy applied
% 7.43/2.34 # Trying AutoSched0 for 150 seconds
% 7.43/2.34 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.43/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.43/2.34 #
% 7.43/2.34 # Preprocessing time : 0.024 s
% 7.43/2.34
% 7.43/2.34 # Proof found!
% 7.43/2.34 # SZS status Theorem
% 7.43/2.34 # SZS output start CNFRefutation
% See solution above
% 7.43/2.34 # Training examples: 0 positive, 0 negative
% 7.43/2.34
% 7.43/2.34 # -------------------------------------------------
% 7.43/2.34 # User time : 0.092 s
% 7.43/2.34 # System time : 0.002 s
% 7.43/2.34 # Total time : 0.094 s
% 7.43/2.34 # Maximum resident set size: 7132 pages
% 7.43/2.34
%------------------------------------------------------------------------------