%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN724+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:56:44 EDT 2022
% Result : Theorem 6.74s 2.19s
% Output : CNFRefutation 6.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 3 unt; 5 nHn; 18 RR)
% Number of literals : 43 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( s(X1)
| s(X2)
| ~ r(X1)
| ~ r(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mubrmtu0/input.p',i_0_1) ).
cnf(i_0_8,negated_conjecture,
( r(esk1_0)
| r(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mubrmtu0/input.p',i_0_8) ).
cnf(i_0_5,negated_conjecture,
( r(esk2_0)
| ~ s(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mubrmtu0/input.p',i_0_5) ).
cnf(i_0_9,negated_conjecture,
( r(esk1_0)
| ~ r(esk2_0)
| ~ s(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mubrmtu0/input.p',i_0_9) ).
cnf(i_0_6,negated_conjecture,
( ~ r(esk2_0)
| ~ s(esk1_0)
| ~ s(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mubrmtu0/input.p',i_0_6) ).
cnf(c_0_15,negated_conjecture,
( s(X1)
| s(X2)
| ~ r(X1)
| ~ r(X2) ),
i_0_1 ).
cnf(c_0_16,negated_conjecture,
( r(esk1_0)
| r(esk2_0) ),
i_0_8 ).
cnf(c_0_17,negated_conjecture,
( r(esk2_0)
| ~ s(esk1_0) ),
i_0_5 ).
cnf(c_0_18,negated_conjecture,
( r(esk1_0)
| ~ r(esk2_0)
| ~ s(esk2_0) ),
i_0_9 ).
cnf(c_0_19,negated_conjecture,
( ~ r(esk2_0)
| ~ s(esk1_0)
| ~ s(esk2_0) ),
i_0_6 ).
cnf(c_0_20,negated_conjecture,
( s(X1)
| r(esk2_0)
| ~ r(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( r(esk1_0)
| ~ s(esk2_0) ),
inference(csr,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ~ s(esk1_0)
| ~ s(esk2_0) ),
inference(csr,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
r(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( s(X1)
| ~ s(esk2_0)
| ~ r(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( s(X1)
| ~ r(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_24]) ).
cnf(c_0_26,negated_conjecture,
~ s(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN724+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 : Tue Jul 12 01:53:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.74/2.19 # ENIGMATIC: Solved by autoschedule:
% 6.74/2.19 # No SInE strategy applied
% 6.74/2.19 # Trying AutoSched0 for 150 seconds
% 6.74/2.19 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 6.74/2.19 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.74/2.19 #
% 6.74/2.19 # Preprocessing time : 0.023 s
% 6.74/2.19
% 6.74/2.19 # Proof found!
% 6.74/2.19 # SZS status Theorem
% 6.74/2.19 # SZS output start CNFRefutation
% See solution above
% 6.74/2.19 # Training examples: 0 positive, 0 negative
% 6.74/2.19
% 6.74/2.19 # -------------------------------------------------
% 6.74/2.19 # User time : 0.022 s
% 6.74/2.19 # System time : 0.007 s
% 6.74/2.19 # Total time : 0.029 s
% 6.74/2.19 # Maximum resident set size: 7120 pages
% 6.74/2.19
%------------------------------------------------------------------------------