TSTP Solution File: RNG115+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG115+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:25:02 EDT 2022
% Result : Theorem 4.47s 3.25s
% Output : CNFRefutation 4.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 4 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_189,negated_conjecture,
( sdtpldt0(X1,X2) != xu
| ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElementOf0(X2,slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q00_qp_n/lgb.p',i_0_189) ).
cnf(i_0_177,hypothesis,
sdtpldt0(esk37_0,esk38_0) = xu,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q00_qp_n/lgb.p',i_0_177) ).
cnf(i_0_178,hypothesis,
aElementOf0(esk38_0,slsdtgt0(xb)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q00_qp_n/lgb.p',i_0_178) ).
cnf(i_0_179,hypothesis,
aElementOf0(esk37_0,slsdtgt0(xa)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q00_qp_n/lgb.p',i_0_179) ).
cnf(c_0_194,negated_conjecture,
( sdtpldt0(X1,X2) != xu
| ~ aElementOf0(X1,slsdtgt0(xa))
| ~ aElementOf0(X2,slsdtgt0(xb)) ),
i_0_189 ).
cnf(c_0_195,hypothesis,
sdtpldt0(esk37_0,esk38_0) = xu,
i_0_177 ).
cnf(c_0_196,hypothesis,
aElementOf0(esk38_0,slsdtgt0(xb)),
i_0_178 ).
cnf(c_0_197,hypothesis,
aElementOf0(esk37_0,slsdtgt0(xa)),
i_0_179 ).
cnf(c_0_198,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_195]),c_0_196]),c_0_197])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG115+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 04:56:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.28/1.45 # ENIGMATIC: Selected complete mode:
% 4.47/3.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.47/3.25 # No SInE strategy applied
% 4.47/3.25 # Trying AutoSched0 for 150 seconds
% 4.47/3.25 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.47/3.25 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.47/3.25 #
% 4.47/3.25 # Preprocessing time : 0.023 s
% 4.47/3.25 # Presaturation interreduction done
% 4.47/3.25
% 4.47/3.25 # Proof found!
% 4.47/3.25 # SZS status Theorem
% 4.47/3.25 # SZS output start CNFRefutation
% See solution above
% 4.47/3.25 # Training examples: 0 positive, 0 negative
% 4.47/3.25
% 4.47/3.25 # -------------------------------------------------
% 4.47/3.25 # User time : 0.024 s
% 4.47/3.25 # System time : 0.006 s
% 4.47/3.25 # Total time : 0.030 s
% 4.47/3.25 # Maximum resident set size: 7120 pages
% 4.47/3.25
%------------------------------------------------------------------------------