TSTP Solution File: RNG124+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG124+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:04 EDT 2022
% Result : Theorem 9.52s 2.59s
% Output : CNFRefutation 9.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 2 nHn; 10 RR)
% Number of literals : 16 ( 6 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_115,hypothesis,
( sz00 = xr
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x8_vgei7/input.p',i_0_115) ).
cnf(i_0_119,hypothesis,
sz00 != xr,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x8_vgei7/input.p',i_0_119) ).
cnf(i_0_106,hypothesis,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x8_vgei7/input.p',i_0_106) ).
cnf(i_0_123,hypothesis,
aElementOf0(xr,xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x8_vgei7/input.p',i_0_123) ).
cnf(c_0_128,hypothesis,
( sz00 = xr
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ),
i_0_115 ).
cnf(c_0_129,hypothesis,
sz00 != xr,
i_0_119 ).
cnf(c_0_130,hypothesis,
( X1 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ),
i_0_106 ).
cnf(c_0_131,hypothesis,
iLess0(sbrdtbr0(xr),sbrdtbr0(xu)),
inference(sr,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,hypothesis,
aElementOf0(xr,xI),
i_0_123 ).
cnf(c_0_133,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]),c_0_129]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG124+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n023.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 20:49:43 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 9.52/2.59 # ENIGMATIC: Solved by autoschedule:
% 9.52/2.59 # No SInE strategy applied
% 9.52/2.59 # Trying AutoSched0 for 150 seconds
% 9.52/2.59 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S050N
% 9.52/2.59 # and selection function PSelectNewComplexExceptUniqMaxHorn.
% 9.52/2.59 #
% 9.52/2.59 # Preprocessing time : 0.015 s
% 9.52/2.59 # Presaturation interreduction done
% 9.52/2.59
% 9.52/2.59 # Proof found!
% 9.52/2.59 # SZS status Theorem
% 9.52/2.59 # SZS output start CNFRefutation
% See solution above
% 9.52/2.59 # Training examples: 0 positive, 0 negative
% 9.52/2.59
% 9.52/2.59 # -------------------------------------------------
% 9.52/2.59 # User time : 0.021 s
% 9.52/2.59 # System time : 0.004 s
% 9.52/2.59 # Total time : 0.025 s
% 9.52/2.59 # Maximum resident set size: 7120 pages
% 9.52/2.59
%------------------------------------------------------------------------------