TSTP Solution File: SYN328+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:17 EDT 2022
% Result : Theorem 7.66s 2.29s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 4 unt; 7 nHn; 15 RR)
% Number of literals : 48 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 0 con; 1-1 aty)
% Number of variables : 22 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
( big_f(X1)
| ~ big_g(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_10) ).
cnf(i_0_5,negated_conjecture,
( big_h(X1)
| big_g(esk1_1(X1))
| ~ big_f(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_5) ).
cnf(i_0_11,negated_conjecture,
( big_f(X1)
| big_f(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_g(X1)
| ~ big_f(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_6) ).
cnf(i_0_4,negated_conjecture,
( big_h(X1)
| ~ big_h(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_4) ).
cnf(i_0_7,negated_conjecture,
( big_g(X1)
| ~ big_h(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_7) ).
cnf(i_0_1,negated_conjecture,
( ~ big_f(esk2_1(X1))
| ~ big_g(esk3_1(X1))
| ~ big_h(esk4_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3fvuo775/lgb.p',i_0_1) ).
cnf(c_0_19,negated_conjecture,
( big_f(X1)
| ~ big_g(esk1_1(X1)) ),
i_0_10 ).
cnf(c_0_20,negated_conjecture,
( big_h(X1)
| big_g(esk1_1(X1))
| ~ big_f(esk1_1(X1)) ),
i_0_5 ).
cnf(c_0_21,negated_conjecture,
( big_f(X1)
| big_f(esk1_1(X1)) ),
i_0_11 ).
cnf(c_0_22,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_g(X1)
| ~ big_f(esk1_1(X1)) ),
i_0_6 ).
cnf(c_0_23,negated_conjecture,
( big_f(X1)
| big_h(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( big_h(X1)
| ~ big_h(esk1_1(X1)) ),
i_0_4 ).
cnf(c_0_25,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_g(X1) ),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( big_f(esk1_1(X1))
| big_h(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( big_g(X1)
| ~ big_h(esk1_1(X1)) ),
i_0_7 ).
cnf(c_0_28,negated_conjecture,
( big_h(esk1_1(esk1_1(X1)))
| big_h(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( big_f(X1)
| ~ big_h(esk1_1(esk1_1(X1))) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
big_h(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( ~ big_f(esk2_1(X1))
| ~ big_g(esk3_1(X1))
| ~ big_h(esk4_1(X1)) ),
i_0_1 ).
cnf(c_0_32,negated_conjecture,
big_f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
big_g(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_30])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30])]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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:35:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.66/2.29 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.29 # No SInE strategy applied
% 7.66/2.29 # Trying AutoSched0 for 150 seconds
% 7.66/2.29 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.66/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.66/2.29 #
% 7.66/2.29 # Preprocessing time : 0.023 s
% 7.66/2.29
% 7.66/2.29 # Proof found!
% 7.66/2.29 # SZS status Theorem
% 7.66/2.29 # SZS output start CNFRefutation
% See solution above
% 7.66/2.29 # Training examples: 0 positive, 0 negative
% 7.66/2.29
% 7.66/2.29 # -------------------------------------------------
% 7.66/2.29 # User time : 0.024 s
% 7.66/2.29 # System time : 0.007 s
% 7.66/2.29 # Total time : 0.031 s
% 7.66/2.29 # Maximum resident set size: 7124 pages
% 7.66/2.29
%------------------------------------------------------------------------------