TSTP Solution File: SYN319+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN319+1 : TPTP v8.1.0. Released v2.0.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:51:10 EDT 2022
% Result : Theorem 4.36s 2.24s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 3 unt; 3 nHn; 7 RR)
% Number of literals : 21 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( big_h(X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cezdlail/lgb.p',i_0_5) ).
cnf(i_0_9,negated_conjecture,
( big_f(X1)
| big_g(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cezdlail/lgb.p',i_0_9) ).
cnf(i_0_1,negated_conjecture,
( ~ big_h(esk3_0)
| ~ big_h(esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cezdlail/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( big_h(X1)
| ~ big_g(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cezdlail/lgb.p',i_0_4) ).
cnf(c_0_14,negated_conjecture,
( big_h(X1)
| ~ big_f(X1) ),
i_0_5 ).
cnf(c_0_15,negated_conjecture,
( big_f(X1)
| big_g(X2) ),
i_0_9 ).
cnf(c_0_16,negated_conjecture,
( ~ big_h(esk3_0)
| ~ big_h(esk4_0) ),
i_0_1 ).
cnf(c_0_17,negated_conjecture,
( big_g(X1)
| big_h(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( big_h(X1)
| ~ big_g(X1) ),
i_0_4 ).
cnf(c_0_19,negated_conjecture,
big_g(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
big_h(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_20]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN319+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n005.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 21:27:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.36/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.36/2.24 # No SInE strategy applied
% 4.36/2.24 # Trying AutoSched0 for 150 seconds
% 4.36/2.24 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.36/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.36/2.24 #
% 4.36/2.24 # Preprocessing time : 0.023 s
% 4.36/2.24
% 4.36/2.24 # Proof found!
% 4.36/2.24 # SZS status Theorem
% 4.36/2.24 # SZS output start CNFRefutation
% See solution above
% 4.36/2.24 # Training examples: 0 positive, 0 negative
% 4.36/2.24
% 4.36/2.24 # -------------------------------------------------
% 4.36/2.24 # User time : 0.023 s
% 4.36/2.24 # System time : 0.005 s
% 4.36/2.24 # Total time : 0.028 s
% 4.36/2.24 # Maximum resident set size: 7120 pages
% 4.36/2.24
%------------------------------------------------------------------------------