TSTP Solution File: SYN918+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:03 EDT 2022
% Result : Theorem 7.45s 2.21s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 4 unt; 5 nHn; 13 RR)
% Number of literals : 43 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 17 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
( f(X1)
| f(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_9) ).
cnf(i_0_3,negated_conjecture,
( g(X1)
| h(X2)
| ~ f(X2)
| ~ f(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
( ~ h(X1)
| ~ g(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_4) ).
cnf(i_0_1,negated_conjecture,
( h(X1)
| ~ f(X1)
| ~ g(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_1) ).
cnf(i_0_8,negated_conjecture,
( f(X1)
| ~ g(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
( g(X1)
| ~ g(esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_6) ).
cnf(i_0_2,negated_conjecture,
( g(X1)
| ~ f(X1)
| ~ h(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0_fhsfz1/input.p',i_0_2) ).
cnf(c_0_17,negated_conjecture,
( f(X1)
| f(esk1_0) ),
i_0_9 ).
cnf(c_0_18,negated_conjecture,
( g(X1)
| h(X2)
| ~ f(X2)
| ~ f(X1) ),
i_0_3 ).
cnf(c_0_19,negated_conjecture,
f(esk1_0),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ h(X1)
| ~ g(esk1_0) ),
i_0_4 ).
cnf(c_0_21,negated_conjecture,
( h(X1)
| ~ f(X1)
| ~ g(X1) ),
i_0_1 ).
cnf(c_0_22,negated_conjecture,
( f(X1)
| ~ g(esk1_0) ),
i_0_8 ).
cnf(c_0_23,negated_conjecture,
( g(X1)
| ~ g(esk1_0) ),
i_0_6 ).
cnf(c_0_24,negated_conjecture,
( h(esk1_0)
| g(X1)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ g(esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( g(X1)
| ~ f(X1)
| ~ h(X1) ),
i_0_2 ).
cnf(c_0_27,negated_conjecture,
h(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN918+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 19:21:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.45/2.21 # ENIGMATIC: Solved by autoschedule:
% 7.45/2.21 # No SInE strategy applied
% 7.45/2.21 # Trying AutoSched0 for 150 seconds
% 7.45/2.21 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.45/2.21 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.45/2.21 #
% 7.45/2.21 # Preprocessing time : 0.023 s
% 7.45/2.21
% 7.45/2.21 # Proof found!
% 7.45/2.21 # SZS status Theorem
% 7.45/2.21 # SZS output start CNFRefutation
% See solution above
% 7.45/2.21 # Training examples: 0 positive, 0 negative
% 7.45/2.21
% 7.45/2.21 # -------------------------------------------------
% 7.45/2.21 # User time : 0.025 s
% 7.45/2.21 # System time : 0.004 s
% 7.45/2.21 # Total time : 0.029 s
% 7.45/2.21 # Maximum resident set size: 7120 pages
% 7.45/2.21
%------------------------------------------------------------------------------