TSTP Solution File: RNG125+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG125+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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.29s 2.42s
% Output : CNFRefutation 8.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 16 unt; 0 nHn; 25 RR)
% Number of literals : 40 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_26) ).
cnf(i_0_108,hypothesis,
aElementOf0(xu,xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_108) ).
cnf(i_0_54,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_54) ).
cnf(i_0_99,hypothesis,
aIdeal0(xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_99) ).
cnf(i_0_75,plain,
( aDivisorOf0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_75) ).
cnf(i_0_114,hypothesis,
doDivides0(xu,xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_114) ).
cnf(i_0_94,hypothesis,
aElement0(xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_94) ).
cnf(i_0_109,hypothesis,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_109) ).
cnf(i_0_113,hypothesis,
doDivides0(xu,xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_113) ).
cnf(i_0_95,hypothesis,
aElement0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8qwtct04/lgb.p',i_0_95) ).
cnf(c_0_125,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_26 ).
cnf(c_0_126,hypothesis,
aElementOf0(xu,xI),
i_0_108 ).
cnf(c_0_127,hypothesis,
( aElement0(xu)
| ~ aSet0(xI) ),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_128,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
i_0_54 ).
cnf(c_0_129,hypothesis,
aIdeal0(xI),
i_0_99 ).
cnf(c_0_130,plain,
( aDivisorOf0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2) ),
i_0_75 ).
cnf(c_0_131,hypothesis,
doDivides0(xu,xb),
i_0_114 ).
cnf(c_0_132,hypothesis,
aElement0(xb),
i_0_94 ).
cnf(c_0_133,plain,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129])]) ).
cnf(c_0_134,hypothesis,
( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ),
i_0_109 ).
cnf(c_0_135,hypothesis,
aDivisorOf0(xu,xb),
inference(cn,[status(thm)],[inference(rw,[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_133])]) ).
cnf(c_0_136,hypothesis,
doDivides0(xu,xa),
i_0_113 ).
cnf(c_0_137,hypothesis,
aElement0(xa),
i_0_95 ).
cnf(c_0_138,hypothesis,
~ aDivisorOf0(xu,xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_135])]) ).
cnf(c_0_139,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_136]),c_0_137])]),c_0_133])]),c_0_138]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG125+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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:55:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.29/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.29/2.42 # No SInE strategy applied
% 8.29/2.42 # Trying AutoSched0 for 150 seconds
% 8.29/2.42 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.29/2.42 # and selection function SelectNewComplexAHPNS.
% 8.29/2.42 #
% 8.29/2.42 # Preprocessing time : 0.024 s
% 8.29/2.42
% 8.29/2.42 # Proof found!
% 8.29/2.42 # SZS status Theorem
% 8.29/2.42 # SZS output start CNFRefutation
% See solution above
% 8.29/2.42 # Training examples: 0 positive, 0 negative
% 8.29/2.42
% 8.29/2.42 # -------------------------------------------------
% 8.29/2.42 # User time : 0.031 s
% 8.29/2.42 # System time : 0.003 s
% 8.29/2.42 # Total time : 0.034 s
% 8.29/2.42 # Maximum resident set size: 7124 pages
% 8.29/2.42
%------------------------------------------------------------------------------