TSTP Solution File: NUM605+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 08:37:50 EDT 2022
% Result : Theorem 6.50s 3.65s
% Output : CNFRefutation 6.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 10 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 : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_68,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fdzmhioj/lgb.p',i_0_68) ).
cnf(i_0_4252,negated_conjecture,
xQ = slcrc0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fdzmhioj/lgb.p',i_0_4252) ).
cnf(i_0_4248,hypothesis,
sbrdtbr0(xQ) = xK,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fdzmhioj/lgb.p',i_0_4248) ).
cnf(i_0_4251,hypothesis,
aSet0(xQ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fdzmhioj/lgb.p',i_0_4251) ).
cnf(i_0_4137,hypothesis,
sz00 != xK,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fdzmhioj/lgb.p',i_0_4137) ).
cnf(c_0_4258,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
i_0_68 ).
cnf(c_0_4259,negated_conjecture,
xQ = slcrc0,
i_0_4252 ).
cnf(c_0_4260,hypothesis,
sbrdtbr0(xQ) = xK,
i_0_4248 ).
cnf(c_0_4261,hypothesis,
aSet0(xQ),
i_0_4251 ).
cnf(c_0_4262,hypothesis,
sz00 != xK,
i_0_4137 ).
cnf(c_0_4263,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_4258,c_0_4259])]),c_0_4260]),c_0_4261])]),c_0_4262]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM605+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jul 5 02:46:33 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 6.50/3.65 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.50/3.65 # No SInE strategy applied
% 6.50/3.65 # Trying AutoSched0 for 150 seconds
% 6.50/3.65 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 6.50/3.65 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.50/3.65 #
% 6.50/3.65 # Preprocessing time : 0.025 s
% 6.50/3.65
% 6.50/3.65 # Proof found!
% 6.50/3.65 # SZS status Theorem
% 6.50/3.65 # SZS output start CNFRefutation
% See solution above
% 6.50/3.65 # Training examples: 0 positive, 0 negative
% 6.50/3.65
% 6.50/3.65 # -------------------------------------------------
% 6.50/3.65 # User time : 0.027 s
% 6.50/3.65 # System time : 0.005 s
% 6.50/3.65 # Total time : 0.033 s
% 6.50/3.65 # Maximum resident set size: 7120 pages
% 6.50/3.65
%------------------------------------------------------------------------------