TSTP Solution File: SYN411+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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 : Thu Jul 21 04:52:06 EDT 2022
% Result : Theorem 4.66s 2.27s
% Output : CNFRefutation 4.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of clauses : 6 ( 2 unt; 2 nHn; 3 RR)
% Number of literals : 10 ( 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-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 15 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
( ~ f(esk1_0,esk2_0,esk3_0)
| ~ f(esk4_0,esk5_0,esk6_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0aq64kpl/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
( f(X1,X2,X3)
| f(X4,X5,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0aq64kpl/lgb.p',i_0_1) ).
cnf(c_0_5,negated_conjecture,
( ~ f(esk1_0,esk2_0,esk3_0)
| ~ f(esk4_0,esk5_0,esk6_0) ),
i_0_2 ).
cnf(c_0_6,negated_conjecture,
( f(X1,X2,X3)
| f(X4,X5,X6) ),
i_0_1 ).
cnf(c_0_7,negated_conjecture,
f(X1,X2,X3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_7]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n014.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 Jul 11 22:23:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 4.66/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.66/2.27 # No SInE strategy applied
% 4.66/2.27 # Trying AutoSched0 for 150 seconds
% 4.66/2.27 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.66/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.66/2.27 #
% 4.66/2.27 # Preprocessing time : 0.012 s
% 4.66/2.27
% 4.66/2.27 # Proof found!
% 4.66/2.27 # SZS status Theorem
% 4.66/2.27 # SZS output start CNFRefutation
% See solution above
% 4.66/2.27 # Training examples: 0 positive, 0 negative
% 4.66/2.27
% 4.66/2.27 # -------------------------------------------------
% 4.66/2.27 # User time : 0.013 s
% 4.66/2.27 # System time : 0.002 s
% 4.66/2.27 # Total time : 0.015 s
% 4.66/2.27 # Maximum resident set size: 7128 pages
% 4.66/2.27
%------------------------------------------------------------------------------