TSTP Solution File: SYN058+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:21 EDT 2022
% Result : Theorem 7.88s 2.50s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 27 ~; 16 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 5 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 9 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( big_q(X1)
| ~ big_p(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4ax0h21a/lgb.p',i_0_1) ).
cnf(i_0_9,negated_conjecture,
big_p(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4ax0h21a/lgb.p',i_0_9) ).
cnf(i_0_4,plain,
( big_s(esk2_0)
| ~ big_q(esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4ax0h21a/lgb.p',i_0_4) ).
cnf(i_0_6,plain,
( big_g(X1)
| ~ big_s(X2)
| ~ big_f(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4ax0h21a/lgb.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
~ big_g(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4ax0h21a/lgb.p',i_0_7) ).
cnf(i_0_8,negated_conjecture,
big_f(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4ax0h21a/lgb.p',i_0_8) ).
fof(c_0_16,plain,
( ~ epred2_0
<=> ! [X2] : ~ big_p(X2) ),
introduced(definition) ).
fof(c_0_17,plain,
( ~ epred4_0
<=> ! [X2] : ~ big_s(X2) ),
introduced(definition) ).
fof(c_0_18,plain,
( ~ epred1_0
<=> ! [X1] : big_q(X1) ),
introduced(definition) ).
cnf(c_0_19,plain,
( big_q(X1)
| ~ big_p(X2) ),
i_0_1 ).
cnf(c_0_20,plain,
( epred2_0
| ~ big_p(X1) ),
inference(split_equiv,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
big_p(esk3_0),
i_0_9 ).
cnf(c_0_22,plain,
( epred4_0
| ~ big_s(X1) ),
inference(split_equiv,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( big_s(esk2_0)
| ~ big_q(esk1_0) ),
i_0_4 ).
cnf(c_0_24,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_18]),c_0_16]) ).
cnf(c_0_25,negated_conjecture,
epred2_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
( ~ epred3_0
<=> ! [X1] :
( big_g(X1)
| ~ big_f(X1) ) ),
introduced(definition) ).
cnf(c_0_27,plain,
( big_g(X1)
| ~ big_s(X2)
| ~ big_f(X1) ),
i_0_6 ).
cnf(c_0_28,plain,
( epred4_0
| ~ big_q(esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( epred1_0
| big_q(X1) ),
inference(split_equiv,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_31,plain,
( ~ epred4_0
| ~ epred3_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27,c_0_26]),c_0_17]) ).
cnf(c_0_32,plain,
epred4_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
~ epred3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
~ big_g(esk3_0),
i_0_7 ).
cnf(c_0_35,plain,
( big_g(X1)
| ~ big_f(X1) ),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_26]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
big_f(esk3_0),
i_0_8 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 05:06:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.88/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.88/2.50 # No SInE strategy applied
% 7.88/2.50 # Trying AutoSched0 for 150 seconds
% 7.88/2.50 # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 7.88/2.50 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.88/2.50 #
% 7.88/2.50 # Preprocessing time : 0.024 s
% 7.88/2.50
% 7.88/2.50 # Proof found!
% 7.88/2.50 # SZS status Theorem
% 7.88/2.50 # SZS output start CNFRefutation
% See solution above
% 7.88/2.50 # Training examples: 0 positive, 0 negative
% 7.88/2.50
% 7.88/2.50 # -------------------------------------------------
% 7.88/2.50 # User time : 0.026 s
% 7.88/2.50 # System time : 0.006 s
% 7.88/2.50 # Total time : 0.032 s
% 7.88/2.50 # Maximum resident set size: 7124 pages
% 7.88/2.50
%------------------------------------------------------------------------------