TSTP Solution File: SYN979+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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.55s 2.28s
% Output : CNFRefutation 4.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( p(X1,X2)
| ~ s(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ko6033ou/lgb.p',i_0_3) ).
cnf(i_0_2,negated_conjecture,
s(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ko6033ou/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
~ p(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ko6033ou/lgb.p',i_0_1) ).
cnf(c_0_7,negated_conjecture,
( p(X1,X2)
| ~ s(esk1_0) ),
i_0_3 ).
cnf(c_0_8,negated_conjecture,
s(esk1_0),
i_0_2 ).
cnf(c_0_9,negated_conjecture,
~ p(esk1_0,esk2_0),
i_0_1 ).
cnf(c_0_10,negated_conjecture,
p(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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:35:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.55/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.55/2.28 # No SInE strategy applied
% 4.55/2.28 # Trying AutoSched0 for 150 seconds
% 4.55/2.28 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.55/2.28 # and selection function SelectCQPrecWNTNp.
% 4.55/2.28 #
% 4.55/2.28 # Preprocessing time : 0.012 s
% 4.55/2.28
% 4.55/2.28 # Proof found!
% 4.55/2.28 # SZS status Theorem
% 4.55/2.28 # SZS output start CNFRefutation
% See solution above
% 4.55/2.28 # Training examples: 0 positive, 0 negative
% 4.55/2.28
% 4.55/2.28 # -------------------------------------------------
% 4.55/2.28 # User time : 0.012 s
% 4.55/2.28 # System time : 0.005 s
% 4.55/2.28 # Total time : 0.017 s
% 4.55/2.28 # Maximum resident set size: 7128 pages
% 4.55/2.28
%------------------------------------------------------------------------------