TSTP Solution File: SYN070+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN070+1 : TPTP v8.1.0. Released v2.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:32 EDT 2022
% Result : Theorem 7.77s 2.31s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 8 unt; 9 nHn; 15 RR)
% Number of literals : 57 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 31 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( big_f(X1)
| big_g(X2)
| ~ big_f(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_3) ).
cnf(i_0_9,negated_conjecture,
big_f(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_9) ).
cnf(i_0_8,negated_conjecture,
~ big_g(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
( big_g(X1)
| big_g(X2)
| big_j(esk1_0,X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_4) ).
cnf(i_0_1,plain,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_1) ).
cnf(i_0_7,plain,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X2,X1)
| ~ big_j(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_7) ).
cnf(i_0_2,plain,
( big_g(X1)
| big_h(X2,X1)
| ~ big_f(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-isma4g7n/lgb.p',i_0_2) ).
cnf(c_0_17,plain,
( big_f(X1)
| big_g(X2)
| ~ big_f(X2) ),
i_0_3 ).
cnf(c_0_18,negated_conjecture,
big_f(esk2_0),
i_0_9 ).
cnf(c_0_19,negated_conjecture,
~ big_g(esk2_0),
i_0_8 ).
cnf(c_0_20,plain,
( big_g(X1)
| big_g(X2)
| big_j(esk1_0,X2)
| ~ big_f(X1)
| ~ big_f(X2) ),
i_0_4 ).
cnf(c_0_21,plain,
( big_g(X1)
| ~ big_f(X1)
| ~ big_g(X2) ),
i_0_1 ).
cnf(c_0_22,plain,
( ~ big_f(X1)
| ~ big_f(X2)
| ~ big_h(X2,X1)
| ~ big_j(X1,X2) ),
i_0_7 ).
cnf(c_0_23,negated_conjecture,
big_f(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
( big_j(esk1_0,X1)
| big_g(X1)
| ~ big_f(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_17]),c_0_21]) ).
cnf(c_0_25,plain,
( ~ big_h(X1,X2)
| ~ big_j(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]) ).
cnf(c_0_26,plain,
( big_j(esk1_0,X1)
| big_g(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23])]) ).
cnf(c_0_27,plain,
( big_g(X1)
| big_h(X2,X1)
| ~ big_f(X1) ),
i_0_2 ).
cnf(c_0_28,plain,
( big_g(X1)
| ~ big_h(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( big_h(X1,X2)
| big_g(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_23])]) ).
cnf(c_0_30,plain,
( big_g(X1)
| ~ big_g(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_23])]) ).
cnf(c_0_31,plain,
big_g(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
big_g(X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN070+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/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 : Mon Jul 11 20:51:34 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.77/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.77/2.31 # No SInE strategy applied
% 7.77/2.31 # Trying AutoSched0 for 150 seconds
% 7.77/2.31 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.77/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.77/2.31 #
% 7.77/2.31 # Preprocessing time : 0.023 s
% 7.77/2.31
% 7.77/2.31 # Proof found!
% 7.77/2.31 # SZS status Theorem
% 7.77/2.31 # SZS output start CNFRefutation
% See solution above
% 7.77/2.31 # Training examples: 0 positive, 0 negative
% 7.77/2.31
% 7.77/2.31 # -------------------------------------------------
% 7.77/2.31 # User time : 0.020 s
% 7.77/2.31 # System time : 0.010 s
% 7.77/2.31 # Total time : 0.030 s
% 7.77/2.31 # Maximum resident set size: 7124 pages
% 7.77/2.31
%------------------------------------------------------------------------------