TSTP Solution File: SYN066+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:28 EDT 2022
% Result : Theorem 4.52s 2.22s
% Output : CNFRefutation 4.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 6 unt; 3 nHn; 5 RR)
% Number of literals : 20 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( big_r(X1,X1)
| ~ big_q(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dpb99y0i/input.p',i_0_5) ).
cnf(i_0_4,plain,
( big_p(X1,X2)
| big_q(esk4_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dpb99y0i/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
~ big_r(esk5_0,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dpb99y0i/input.p',i_0_6) ).
cnf(i_0_1,plain,
( big_q(esk3_2(X1,X2),esk1_1(X1))
| ~ big_p(esk2_2(X1,X2),esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dpb99y0i/input.p',i_0_1) ).
cnf(c_0_11,plain,
( big_r(X1,X1)
| ~ big_q(X2,X3) ),
i_0_5 ).
cnf(c_0_12,plain,
( big_p(X1,X2)
| big_q(esk4_2(X1,X2),X2) ),
i_0_4 ).
cnf(c_0_13,negated_conjecture,
~ big_r(esk5_0,X1),
i_0_6 ).
cnf(c_0_14,plain,
( big_r(X1,X1)
| big_p(X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( big_q(esk3_2(X1,X2),esk1_1(X1))
| ~ big_p(esk2_2(X1,X2),esk1_1(X1)) ),
i_0_1 ).
cnf(c_0_16,negated_conjecture,
big_p(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
big_q(esk3_2(X1,X2),esk1_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_18,plain,
big_r(X1,X1),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_13,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 09:16:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.52/2.22 # ENIGMATIC: Solved by autoschedule:
% 4.52/2.22 # No SInE strategy applied
% 4.52/2.22 # Trying AutoSched0 for 150 seconds
% 4.52/2.22 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 4.52/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.52/2.22 #
% 4.52/2.22 # Preprocessing time : 0.013 s
% 4.52/2.22
% 4.52/2.22 # Proof found!
% 4.52/2.22 # SZS status Theorem
% 4.52/2.22 # SZS output start CNFRefutation
% See solution above
% 4.52/2.22 # Training examples: 0 positive, 0 negative
% 4.52/2.22
% 4.52/2.22 # -------------------------------------------------
% 4.52/2.22 # User time : 0.012 s
% 4.52/2.22 # System time : 0.005 s
% 4.52/2.22 # Total time : 0.017 s
% 4.52/2.22 # Maximum resident set size: 7124 pages
% 4.52/2.22
%------------------------------------------------------------------------------