TSTP Solution File: SYN980+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.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:58:36 EDT 2022
% Result : Theorem 4.36s 2.27s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 4 unt; 2 nHn; 11 RR)
% Number of literals : 22 ( 0 equ; 10 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 : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 13 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
( q(f(esk1_0),esk1_0)
| ~ p(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-928xp7cp/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
( p(f(X1),X1)
| ~ r(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-928xp7cp/lgb.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
( r(esk1_0)
| p(f(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-928xp7cp/lgb.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
( ~ p(X1,X2)
| ~ q(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-928xp7cp/lgb.p',i_0_1) ).
cnf(c_0_9,negated_conjecture,
( q(f(esk1_0),esk1_0)
| ~ p(X1,X2) ),
i_0_2 ).
cnf(c_0_10,negated_conjecture,
( p(f(X1),X1)
| ~ r(X1) ),
i_0_3 ).
cnf(c_0_11,negated_conjecture,
( r(esk1_0)
| p(f(X1),X1) ),
i_0_4 ).
cnf(c_0_12,negated_conjecture,
( q(f(esk1_0),esk1_0)
| ~ r(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ p(X1,X2)
| ~ q(X1,X2) ),
i_0_1 ).
cnf(c_0_14,negated_conjecture,
q(f(esk1_0),esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ p(f(esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
r(esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 : Mon Jul 11 13:57:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.36/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.36/2.27 # No SInE strategy applied
% 4.36/2.27 # Trying AutoSched0 for 150 seconds
% 4.36/2.27 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.36/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.36/2.27 #
% 4.36/2.27 # Preprocessing time : 0.013 s
% 4.36/2.27
% 4.36/2.27 # Proof found!
% 4.36/2.27 # SZS status Theorem
% 4.36/2.27 # SZS output start CNFRefutation
% See solution above
% 4.36/2.27 # Training examples: 0 positive, 0 negative
% 4.36/2.27
% 4.36/2.27 # -------------------------------------------------
% 4.36/2.27 # User time : 0.012 s
% 4.36/2.27 # System time : 0.007 s
% 4.36/2.27 # Total time : 0.019 s
% 4.36/2.27 # Maximum resident set size: 7124 pages
% 4.36/2.27
%------------------------------------------------------------------------------