TSTP Solution File: SYN944+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.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 : Thu Jul 21 04:58:22 EDT 2022
% Result : Theorem 7.07s 2.47s
% Output : CNFRefutation 7.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 6 unt; 0 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( ~ p(X1)
| ~ q(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mb7j0vy/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
( q(X1,X2)
| ~ r(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mb7j0vy/input.p',i_0_2) ).
cnf(i_0_4,negated_conjecture,
r(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mb7j0vy/input.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
( p(X1)
| ~ s(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mb7j0vy/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
s(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mb7j0vy/input.p',i_0_5) ).
cnf(c_0_11,negated_conjecture,
( ~ p(X1)
| ~ q(X1,X2) ),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
( q(X1,X2)
| ~ r(X1,X2) ),
i_0_2 ).
cnf(c_0_13,negated_conjecture,
( ~ p(X1)
| ~ r(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
r(esk2_0,esk3_0),
i_0_4 ).
cnf(c_0_15,negated_conjecture,
~ p(esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( p(X1)
| ~ s(X1) ),
i_0_3 ).
cnf(c_0_17,negated_conjecture,
s(esk2_0),
i_0_5 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN944+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 08:47:39 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.45 # ENIGMATIC: Selected complete mode:
% 7.07/2.47 # ENIGMATIC: Solved by autoschedule:
% 7.07/2.47 # No SInE strategy applied
% 7.07/2.47 # Trying AutoSched0 for 150 seconds
% 7.07/2.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.07/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.07/2.47 #
% 7.07/2.47 # Preprocessing time : 0.012 s
% 7.07/2.47 # Presaturation interreduction done
% 7.07/2.47
% 7.07/2.47 # Proof found!
% 7.07/2.47 # SZS status Theorem
% 7.07/2.47 # SZS output start CNFRefutation
% See solution above
% 7.07/2.47 # Training examples: 0 positive, 0 negative
% 7.07/2.47
% 7.07/2.47 # -------------------------------------------------
% 7.07/2.47 # User time : 0.013 s
% 7.07/2.47 # System time : 0.003 s
% 7.07/2.47 # Total time : 0.016 s
% 7.07/2.47 # Maximum resident set size: 7116 pages
% 7.07/2.47
%------------------------------------------------------------------------------