TSTP Solution File: SYN317+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN317+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:51:09 EDT 2022
% Result : Theorem 10.44s 2.84s
% Output : CNFRefutation 10.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 3 unt; 5 nHn; 7 RR)
% Number of literals : 21 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( big_f(X1)
| big_f(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n4i7k5s7/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
( big_g(esk1_0)
| big_g(esk3_0)
| ~ big_f(esk1_0)
| ~ big_f(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n4i7k5s7/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
( ~ big_g(X1)
| ~ big_g(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n4i7k5s7/input.p',i_0_2) ).
cnf(c_0_9,negated_conjecture,
( big_f(X1)
| big_f(X2) ),
i_0_5 ).
cnf(c_0_10,negated_conjecture,
( big_g(esk1_0)
| big_g(esk3_0)
| ~ big_f(esk1_0)
| ~ big_f(esk2_0) ),
i_0_1 ).
cnf(c_0_11,negated_conjecture,
big_f(X1),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ big_g(X1)
| ~ big_g(X2) ),
i_0_2 ).
cnf(c_0_13,negated_conjecture,
( big_g(esk1_0)
| big_g(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
~ big_g(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_14]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN317+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.28 % Computer : n011.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Tue Jul 12 04:44:44 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected complete mode:
% 10.44/2.84 # ENIGMATIC: Solved by autoschedule:
% 10.44/2.84 # No SInE strategy applied
% 10.44/2.84 # Trying AutoSched0 for 150 seconds
% 10.44/2.84 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 10.44/2.84 # and selection function SelectMaxLComplexAvoidPosPred.
% 10.44/2.84 #
% 10.44/2.84 # Preprocessing time : 0.023 s
% 10.44/2.84
% 10.44/2.84 # Proof found!
% 10.44/2.84 # SZS status Theorem
% 10.44/2.84 # SZS output start CNFRefutation
% See solution above
% 10.44/2.84 # Training examples: 0 positive, 0 negative
% 10.44/2.84
% 10.44/2.84 # -------------------------------------------------
% 10.44/2.84 # User time : 0.022 s
% 10.44/2.84 # System time : 0.005 s
% 10.44/2.84 # Total time : 0.027 s
% 10.44/2.84 # Maximum resident set size: 7124 pages
% 10.44/2.84
%------------------------------------------------------------------------------