%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:05 EDT 2022
% Result : Theorem 8.20s 2.47s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 3 unt; 3 nHn; 12 RR)
% Number of literals : 25 ( 0 equ; 14 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( ~ p(X1)
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8suhkh94/input.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
( p(esk1_0)
| p(esk2_0)
| q(esk1_0)
| q(esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8suhkh94/input.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
( ~ p(X1)
| ~ p(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8suhkh94/input.p',i_0_5) ).
cnf(i_0_2,negated_conjecture,
( ~ q(X1)
| ~ q(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8suhkh94/input.p',i_0_2) ).
cnf(c_0_10,negated_conjecture,
( ~ p(X1)
| ~ q(X2) ),
i_0_4 ).
cnf(c_0_11,negated_conjecture,
( p(esk1_0)
| p(esk2_0)
| q(esk1_0)
| q(esk3_0) ),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
( ~ p(X1)
| ~ p(X2) ),
i_0_5 ).
cnf(c_0_13,negated_conjecture,
~ p(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_12]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ q(X1)
| ~ q(X2) ),
i_0_2 ).
cnf(c_0_15,negated_conjecture,
( q(esk1_0)
| q(esk3_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11,c_0_13]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ q(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_16]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 14:18:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.20/2.47 # ENIGMATIC: Solved by autoschedule:
% 8.20/2.47 # No SInE strategy applied
% 8.20/2.47 # Trying AutoSched0 for 150 seconds
% 8.20/2.47 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 8.20/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.20/2.47 #
% 8.20/2.47 # Preprocessing time : 0.013 s
% 8.20/2.47
% 8.20/2.47 # Proof found!
% 8.20/2.47 # SZS status Theorem
% 8.20/2.47 # SZS output start CNFRefutation
% See solution above
% 8.20/2.47 # Training examples: 0 positive, 0 negative
% 8.20/2.47
% 8.20/2.47 # -------------------------------------------------
% 8.20/2.47 # User time : 0.015 s
% 8.20/2.47 # System time : 0.002 s
% 8.20/2.47 # Total time : 0.017 s
% 8.20/2.47 # Maximum resident set size: 7120 pages
% 8.20/2.47
%------------------------------------------------------------------------------