TSTP Solution File: RNG089+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG089+2 : 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:57 EDT 2022
% Result : Theorem 7.70s 2.30s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 24 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_80,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u67xvsap/lgb.p',i_0_80) ).
cnf(i_0_56,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xJ)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xJ) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u67xvsap/lgb.p',i_0_56) ).
cnf(i_0_63,hypothesis,
aElement0(xz),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u67xvsap/lgb.p',i_0_63) ).
cnf(i_0_73,hypothesis,
aElementOf0(xl,xJ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u67xvsap/lgb.p',i_0_73) ).
cnf(i_0_60,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xI) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u67xvsap/lgb.p',i_0_60) ).
cnf(i_0_74,hypothesis,
aElementOf0(xk,xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u67xvsap/lgb.p',i_0_74) ).
cnf(c_0_87,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xz,xk),xI)
| ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
i_0_80 ).
cnf(c_0_88,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xJ)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xJ) ),
i_0_56 ).
cnf(c_0_89,hypothesis,
aElement0(xz),
i_0_63 ).
cnf(c_0_90,hypothesis,
aElementOf0(xl,xJ),
i_0_73 ).
cnf(c_0_91,negated_conjecture,
~ aElementOf0(sdtasdt0(xz,xk),xI),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_90])]) ).
cnf(c_0_92,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xI) ),
i_0_60 ).
cnf(c_0_93,hypothesis,
aElementOf0(xk,xI),
i_0_74 ).
cnf(c_0_94,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_89]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG089+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 10:18:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.70/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.30 # No SInE strategy applied
% 7.70/2.30 # Trying AutoSched0 for 150 seconds
% 7.70/2.30 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.70/2.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.70/2.30 #
% 7.70/2.30 # Preprocessing time : 0.023 s
% 7.70/2.30 # Presaturation interreduction done
% 7.70/2.30
% 7.70/2.30 # Proof found!
% 7.70/2.30 # SZS status Theorem
% 7.70/2.30 # SZS output start CNFRefutation
% See solution above
% 7.70/2.30 # Training examples: 0 positive, 0 negative
% 7.70/2.30
% 7.70/2.30 # -------------------------------------------------
% 7.70/2.30 # User time : 0.024 s
% 7.70/2.30 # System time : 0.007 s
% 7.70/2.30 # Total time : 0.031 s
% 7.70/2.30 # Maximum resident set size: 7124 pages
% 7.70/2.30
%------------------------------------------------------------------------------