%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.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:49:38 EDT 2022
% Result : Theorem 7.28s 2.36s
% Output : CNFRefutation 7.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( big_f(X1,X2)
| ~ big_f(X3,X2)
| ~ big_f(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1it_adxh/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
big_f(f(b,c),f(a,c)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1it_adxh/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
big_f(f(a,b),f(b,c)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1it_adxh/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1it_adxh/lgb.p',i_0_4) ).
cnf(c_0_9,plain,
( big_f(X1,X2)
| ~ big_f(X3,X2)
| ~ big_f(X1,X3) ),
i_0_3 ).
cnf(c_0_10,plain,
big_f(f(b,c),f(a,c)),
i_0_2 ).
cnf(c_0_11,plain,
( big_f(X1,f(a,c))
| ~ big_f(X1,f(b,c)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
big_f(f(a,b),f(b,c)),
i_0_1 ).
cnf(c_0_13,negated_conjecture,
~ big_f(f(a,b),f(a,c)),
i_0_4 ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN079+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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 : Mon Jul 11 13:37:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.28/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.28/2.36 # No SInE strategy applied
% 7.28/2.36 # Trying AutoSched0 for 150 seconds
% 7.28/2.36 # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.28/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.28/2.36 #
% 7.28/2.36 # Preprocessing time : 0.022 s
% 7.28/2.36
% 7.28/2.36 # Proof found!
% 7.28/2.36 # SZS status Theorem
% 7.28/2.36 # SZS output start CNFRefutation
% See solution above
% 7.28/2.36 # Training examples: 0 positive, 0 negative
% 7.28/2.36
% 7.28/2.36 # -------------------------------------------------
% 7.28/2.36 # User time : 0.024 s
% 7.28/2.36 # System time : 0.004 s
% 7.28/2.36 # Total time : 0.028 s
% 7.28/2.36 # Maximum resident set size: 7124 pages
% 7.28/2.36
%------------------------------------------------------------------------------