TSTP Solution File: NUM557+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM557+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:19 EDT 2022
% Result : Theorem 7.21s 2.22s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 10 ( 4 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_176,negated_conjecture,
( sbrdtbr0(xP) != xk
| ~ aSubsetOf0(xP,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kvpflq0a/lgb.p',i_0_176) ).
cnf(i_0_172,hypothesis,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kvpflq0a/lgb.p',i_0_172) ).
cnf(i_0_173,hypothesis,
aSubsetOf0(xP,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kvpflq0a/lgb.p',i_0_173) ).
cnf(c_0_180,negated_conjecture,
( sbrdtbr0(xP) != xk
| ~ aSubsetOf0(xP,xS) ),
i_0_176 ).
cnf(c_0_181,hypothesis,
sbrdtbr0(xP) = xk,
i_0_172 ).
cnf(c_0_182,hypothesis,
aSubsetOf0(xP,xS),
i_0_173 ).
cnf(c_0_183,negated_conjecture,
~ aSubsetOf0(xP,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_180,c_0_181])]) ).
cnf(c_0_184,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_182,c_0_183]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM557+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jul 7 07:02:25 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.21/2.22 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.21/2.22 # No SInE strategy applied
% 7.21/2.22 # Trying AutoSched0 for 150 seconds
% 7.21/2.22 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.21/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.21/2.22 #
% 7.21/2.22 # Preprocessing time : 0.026 s
% 7.21/2.22
% 7.21/2.22 # Proof found!
% 7.21/2.22 # SZS status Theorem
% 7.21/2.22 # SZS output start CNFRefutation
% See solution above
% 7.21/2.22 # Training examples: 0 positive, 0 negative
% 7.21/2.22
% 7.21/2.22 # -------------------------------------------------
% 7.21/2.22 # User time : 0.030 s
% 7.21/2.22 # System time : 0.006 s
% 7.21/2.22 # Total time : 0.036 s
% 7.21/2.22 # Maximum resident set size: 7128 pages
% 7.21/2.22
%------------------------------------------------------------------------------