%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN377+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:51:48 EDT 2022
% Result : Theorem 7.04s 2.30s
% Output : CNFRefutation 7.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 16 ( 3 unt; 10 nHn; 6 RR)
% Number of literals : 45 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( big_p(X1)
| big_p(X2)
| big_p(esk1_0)
| big_p(esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0p9v270/input.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
( big_p(X1)
| big_p(X2)
| ~ big_p(X3)
| ~ big_p(X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0p9v270/input.p',i_0_4) ).
cnf(i_0_8,negated_conjecture,
( ~ big_p(X1)
| ~ big_p(esk1_0)
| ~ big_p(esk2_0)
| ~ big_p(esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0p9v270/input.p',i_0_8) ).
cnf(c_0_12,negated_conjecture,
( big_p(X1)
| big_p(X2)
| big_p(esk1_0)
| big_p(esk4_0) ),
i_0_5 ).
cnf(c_0_13,negated_conjecture,
( big_p(esk4_0)
| big_p(esk1_0)
| big_p(X1) ),
inference(ef,[status(thm)],[c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( big_p(X1)
| big_p(X2)
| ~ big_p(X3)
| ~ big_p(X4) ),
i_0_4 ).
cnf(c_0_15,negated_conjecture,
( big_p(esk4_0)
| big_p(esk1_0) ),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( big_p(esk1_0)
| big_p(X1)
| ~ big_p(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( big_p(esk1_0)
| big_p(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
big_p(esk1_0),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_p(X1)
| ~ big_p(esk1_0)
| ~ big_p(esk2_0)
| ~ big_p(esk3_0) ),
i_0_8 ).
cnf(c_0_20,negated_conjecture,
( big_p(X1)
| big_p(X2)
| ~ big_p(X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ big_p(esk2_0)
| ~ big_p(esk3_0)
| ~ big_p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
( big_p(X1)
| big_p(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
big_p(X1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_23]),c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN377+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 06:01:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.04/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.04/2.30 # No SInE strategy applied
% 7.04/2.30 # Trying AutoSched0 for 150 seconds
% 7.04/2.30 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.04/2.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.04/2.30 #
% 7.04/2.30 # Preprocessing time : 0.012 s
% 7.04/2.30
% 7.04/2.30 # Proof found!
% 7.04/2.30 # SZS status Theorem
% 7.04/2.30 # SZS output start CNFRefutation
% See solution above
% 7.04/2.30 # Training examples: 0 positive, 0 negative
% 7.04/2.30
% 7.04/2.30 # -------------------------------------------------
% 7.04/2.30 # User time : 0.013 s
% 7.04/2.30 # System time : 0.005 s
% 7.04/2.30 # Total time : 0.018 s
% 7.04/2.30 # Maximum resident set size: 7120 pages
% 7.04/2.30
%------------------------------------------------------------------------------