TSTP Solution File: SYN057+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN057+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:20 EDT 2022
% Result : Theorem 7.21s 2.23s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 28 ~; 21 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
~ big_g(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_1) ).
cnf(i_0_5,plain,
( big_g(X1)
| ~ big_h(X2)
| ~ big_h(X1)
| ~ big_i(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_5) ).
cnf(i_0_3,plain,
( big_h(X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
big_f(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_2) ).
cnf(i_0_4,plain,
( big_f(X1)
| ~ big_j(X1)
| ~ big_i(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_4) ).
cnf(i_0_7,negated_conjecture,
big_j(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
big_i(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-anmauiv8/lgb.p',i_0_6) ).
fof(c_0_15,plain,
( ~ epred1_0
<=> ! [X1] :
( big_g(X1)
| ~ big_h(X1) ) ),
introduced(definition) ).
cnf(c_0_16,plain,
~ big_g(esk1_0),
i_0_1 ).
cnf(c_0_17,plain,
( epred1_0
| big_g(X1)
| ~ big_h(X1) ),
inference(split_equiv,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
( ~ epred2_0
<=> ! [X2] :
( ~ big_h(X2)
| ~ big_i(X2) ) ),
introduced(definition) ).
cnf(c_0_19,plain,
( big_g(X1)
| ~ big_h(X2)
| ~ big_h(X1)
| ~ big_i(X2) ),
i_0_5 ).
cnf(c_0_20,plain,
( epred1_0
| ~ big_h(esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( big_h(X1)
| ~ big_f(X1) ),
i_0_3 ).
cnf(c_0_22,plain,
big_f(esk1_0),
i_0_2 ).
cnf(c_0_23,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_15]),c_0_18]) ).
cnf(c_0_24,plain,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( epred2_0
| ~ big_i(X1)
| ~ big_h(X1) ),
inference(split_equiv,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
( big_f(X1)
| ~ big_j(X1)
| ~ big_i(X1) ),
i_0_4 ).
cnf(c_0_28,negated_conjecture,
big_j(esk2_0),
i_0_7 ).
cnf(c_0_29,negated_conjecture,
big_i(esk2_0),
i_0_6 ).
cnf(c_0_30,plain,
( ~ big_f(X1)
| ~ big_i(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
big_f(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN057+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 : n007.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 01:21:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.21/2.23 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.21/2.23 # No SInE strategy applied
% 7.21/2.23 # Trying AutoSched0 for 150 seconds
% 7.21/2.23 # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 7.21/2.23 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.21/2.23 #
% 7.21/2.23 # Preprocessing time : 0.023 s
% 7.21/2.23
% 7.21/2.23 # Proof found!
% 7.21/2.23 # SZS status Theorem
% 7.21/2.23 # SZS output start CNFRefutation
% See solution above
% 7.21/2.23 # Training examples: 0 positive, 0 negative
% 7.21/2.23
% 7.21/2.23 # -------------------------------------------------
% 7.21/2.23 # User time : 0.022 s
% 7.21/2.23 # System time : 0.007 s
% 7.21/2.23 # Total time : 0.029 s
% 7.21/2.23 # Maximum resident set size: 7128 pages
% 7.21/2.23
%------------------------------------------------------------------------------