TSTP Solution File: SYN056+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:19 EDT 2022
% Result : Theorem 6.96s 2.19s
% Output : CNFRefutation 6.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 6 unt; 5 nHn; 29 RR)
% Number of literals : 66 ( 0 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 22 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( big_q(esk1_0)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_2) ).
cnf(i_0_9,negated_conjecture,
( big_p(esk3_0)
| big_q(esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_9) ).
cnf(i_0_5,negated_conjecture,
( big_r(X1)
| big_s(X2)
| ~ big_p(X1)
| ~ big_q(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
( big_s(X1)
| ~ big_p(X2)
| ~ big_q(X1)
| ~ big_r(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_4) ).
cnf(i_0_1,plain,
( big_p(esk2_0)
| ~ big_q(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
( big_r(X1)
| ~ big_p(X1)
| ~ big_q(X2)
| ~ big_s(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_3) ).
cnf(i_0_8,negated_conjecture,
( big_p(esk3_0)
| ~ big_s(esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
( ~ big_r(esk3_0)
| ~ big_s(esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
( big_q(esk4_0)
| ~ big_r(esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zdw8imnw/lgb.p',i_0_7) ).
cnf(c_0_19,plain,
( big_q(esk1_0)
| ~ big_p(X1) ),
i_0_2 ).
cnf(c_0_20,negated_conjecture,
( big_p(esk3_0)
| big_q(esk4_0) ),
i_0_9 ).
cnf(c_0_21,negated_conjecture,
( big_r(X1)
| big_s(X2)
| ~ big_p(X1)
| ~ big_q(X2) ),
i_0_5 ).
cnf(c_0_22,plain,
( big_s(X1)
| ~ big_p(X2)
| ~ big_q(X1)
| ~ big_r(X2) ),
i_0_4 ).
cnf(c_0_23,plain,
( big_p(esk2_0)
| ~ big_q(X1) ),
i_0_1 ).
cnf(c_0_24,negated_conjecture,
( big_q(esk4_0)
| big_q(esk1_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( big_s(X1)
| ~ big_q(X1)
| ~ big_p(X2) ),
inference(csr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
big_p(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_23]) ).
cnf(c_0_27,plain,
( big_r(X1)
| ~ big_p(X1)
| ~ big_q(X2)
| ~ big_s(X2) ),
i_0_3 ).
cnf(c_0_28,negated_conjecture,
( big_s(X1)
| ~ big_q(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( big_r(X1)
| ~ big_q(X2)
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
big_q(esk1_0),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( big_p(esk3_0)
| ~ big_s(esk4_0) ),
i_0_8 ).
cnf(c_0_32,negated_conjecture,
( ~ big_r(esk3_0)
| ~ big_s(esk4_0) ),
i_0_6 ).
cnf(c_0_33,plain,
( big_r(X1)
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
big_p(esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_20]) ).
cnf(c_0_35,negated_conjecture,
~ big_s(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,negated_conjecture,
( big_q(esk4_0)
| ~ big_r(esk3_0) ),
i_0_7 ).
cnf(c_0_37,negated_conjecture,
~ big_q(esk4_0),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_34])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jul 11 22:06:14 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 6.96/2.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.96/2.19 # No SInE strategy applied
% 6.96/2.19 # Trying AutoSched0 for 150 seconds
% 6.96/2.19 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 6.96/2.19 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.96/2.19 #
% 6.96/2.19 # Preprocessing time : 0.012 s
% 6.96/2.19
% 6.96/2.19 # Proof found!
% 6.96/2.19 # SZS status Theorem
% 6.96/2.19 # SZS output start CNFRefutation
% See solution above
% 6.96/2.19 # Training examples: 0 positive, 0 negative
% 6.96/2.19
% 6.96/2.19 # -------------------------------------------------
% 6.96/2.19 # User time : 0.012 s
% 6.96/2.19 # System time : 0.004 s
% 6.96/2.19 # Total time : 0.016 s
% 6.96/2.19 # Maximum resident set size: 7124 pages
% 6.96/2.19
%------------------------------------------------------------------------------