TSTP Solution File: RNG055+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG055+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:49 EDT 2022
% Result : Theorem 7.90s 2.39s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 14 unt; 0 nHn; 27 RR)
% Number of literals : 55 ( 14 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
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-n2zbut_z/input.p',i_0_23) ).
cnf(i_0_93,hypothesis,
aScalar0(xN),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_93) ).
cnf(i_0_95,negated_conjecture,
sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)) != sdtasdt0(xP,xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_95) ).
cnf(i_0_24,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_24) ).
cnf(i_0_79,hypothesis,
aScalar0(xE),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_79) ).
cnf(i_0_88,hypothesis,
sdtasdt0(xE,xH) = xP,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_88) ).
cnf(i_0_85,hypothesis,
aScalar0(xH),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_85) ).
cnf(i_0_89,hypothesis,
aScalar0(xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_89) ).
cnf(i_0_13,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n2zbut_z/input.p',i_0_13) ).
cnf(c_0_105,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
i_0_23 ).
cnf(c_0_106,hypothesis,
aScalar0(xN),
i_0_93 ).
cnf(c_0_107,negated_conjecture,
sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)) != sdtasdt0(xP,xP),
i_0_95 ).
cnf(c_0_108,hypothesis,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_109,negated_conjecture,
( sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH)) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_110,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
i_0_24 ).
cnf(c_0_111,hypothesis,
aScalar0(xE),
i_0_79 ).
cnf(c_0_112,hypothesis,
sdtasdt0(xE,xH) = xP,
i_0_88 ).
cnf(c_0_113,hypothesis,
aScalar0(xH),
i_0_85 ).
cnf(c_0_114,plain,
( sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH))) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111])]) ).
cnf(c_0_115,hypothesis,
( sdtasdt0(xE,sdtasdt0(xH,X1)) = sdtasdt0(xP,X1)
| ~ aScalar0(X1) ),
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_111])]) ).
cnf(c_0_116,hypothesis,
( sdtasdt0(xE,sdtasdt0(xP,xH)) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_113])]) ).
cnf(c_0_117,hypothesis,
aScalar0(xP),
i_0_89 ).
cnf(c_0_118,hypothesis,
( sdtasdt0(xE,sdtasdt0(xH,xP)) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_108]),c_0_113]),c_0_117])]) ).
cnf(c_0_119,hypothesis,
( ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_115]),c_0_117])]) ).
cnf(c_0_120,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
i_0_13 ).
cnf(c_0_121,plain,
~ aScalar0(sdtasdt0(xE,xE)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_113])]) ).
cnf(c_0_122,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_120]),c_0_111])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG055+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n029.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 08:00:00 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.90/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.90/2.39 # No SInE strategy applied
% 7.90/2.39 # Trying AutoSched0 for 150 seconds
% 7.90/2.39 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.90/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.39 #
% 7.90/2.39 # Preprocessing time : 0.013 s
% 7.90/2.39
% 7.90/2.39 # Proof found!
% 7.90/2.39 # SZS status Theorem
% 7.90/2.39 # SZS output start CNFRefutation
% See solution above
% 7.90/2.39 # Training examples: 0 positive, 0 negative
% 7.90/2.39
% 7.90/2.39 # -------------------------------------------------
% 7.90/2.39 # User time : 0.078 s
% 7.90/2.39 # System time : 0.006 s
% 7.90/2.39 # Total time : 0.084 s
% 7.90/2.39 # Maximum resident set size: 7124 pages
% 7.90/2.39
%------------------------------------------------------------------------------