TSTP Solution File: SYN061+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:49:24 EDT 2022
% Result : Theorem 7.75s 2.30s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 5 unt; 2 nHn; 11 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( ~ big_f(X1)
| ~ big_h(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-980txqrs/lgb.p',i_0_1) ).
cnf(i_0_5,plain,
( big_h(X1)
| big_j(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-980txqrs/lgb.p',i_0_5) ).
cnf(i_0_6,negated_conjecture,
( ~ big_i(X1)
| ~ big_j(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-980txqrs/lgb.p',i_0_6) ).
cnf(i_0_3,plain,
big_f(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-980txqrs/lgb.p',i_0_3) ).
cnf(i_0_4,plain,
big_i(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-980txqrs/lgb.p',i_0_4) ).
cnf(c_0_12,plain,
( ~ big_f(X1)
| ~ big_h(X1) ),
i_0_1 ).
cnf(c_0_13,plain,
( big_h(X1)
| big_j(X1) ),
i_0_5 ).
cnf(c_0_14,negated_conjecture,
( ~ big_i(X1)
| ~ big_j(X1) ),
i_0_6 ).
cnf(c_0_15,plain,
( big_j(X1)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_f(X1)
| ~ big_i(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
big_f(esk1_0),
i_0_3 ).
cnf(c_0_18,plain,
big_i(esk1_0),
i_0_4 ).
cnf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 19:25:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.75/2.30 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.75/2.30 # No SInE strategy applied
% 7.75/2.30 # Trying AutoSched0 for 150 seconds
% 7.75/2.30 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.75/2.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.75/2.30 #
% 7.75/2.30 # Preprocessing time : 0.012 s
% 7.75/2.30
% 7.75/2.30 # Proof found!
% 7.75/2.30 # SZS status Theorem
% 7.75/2.30 # SZS output start CNFRefutation
% See solution above
% 7.75/2.30 # Training examples: 0 positive, 0 negative
% 7.75/2.30
% 7.75/2.30 # -------------------------------------------------
% 7.75/2.30 # User time : 0.012 s
% 7.75/2.30 # System time : 0.007 s
% 7.75/2.30 # Total time : 0.019 s
% 7.75/2.30 # Maximum resident set size: 7120 pages
% 7.75/2.30
%------------------------------------------------------------------------------