TSTP Solution File: RNG125+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG125+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 8.06s 2.41s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_184,hypothesis,
( ~ doDivides0(xu,xa)
| ~ doDivides0(xu,xb) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u63dcia/lgb.p',i_0_184) ).
cnf(i_0_195,hypothesis,
doDivides0(xu,xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u63dcia/lgb.p',i_0_195) ).
cnf(i_0_192,hypothesis,
doDivides0(xu,xa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0u63dcia/lgb.p',i_0_192) ).
cnf(c_0_199,hypothesis,
( ~ doDivides0(xu,xa)
| ~ doDivides0(xu,xb) ),
i_0_184 ).
cnf(c_0_200,hypothesis,
doDivides0(xu,xb),
i_0_195 ).
cnf(c_0_201,hypothesis,
doDivides0(xu,xa),
i_0_192 ).
cnf(c_0_202,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_200]),c_0_201])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG125+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 14:47:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.06/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.06/2.41 # No SInE strategy applied
% 8.06/2.41 # Trying AutoSched0 for 150 seconds
% 8.06/2.41 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.06/2.41 # and selection function SelectNewComplexAHPNS.
% 8.06/2.41 #
% 8.06/2.41 # Preprocessing time : 0.024 s
% 8.06/2.41
% 8.06/2.41 # Proof found!
% 8.06/2.41 # SZS status Theorem
% 8.06/2.41 # SZS output start CNFRefutation
% See solution above
% 8.06/2.41 # Training examples: 0 positive, 0 negative
% 8.06/2.41
% 8.06/2.41 # -------------------------------------------------
% 8.06/2.41 # User time : 0.023 s
% 8.06/2.41 # System time : 0.006 s
% 8.06/2.41 # Total time : 0.029 s
% 8.06/2.41 # Maximum resident set size: 7128 pages
% 8.06/2.41
%------------------------------------------------------------------------------