TSTP Solution File: SYN331+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN331+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:19 EDT 2022
% Result : Theorem 7.88s 2.37s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 5 unt; 3 nHn; 5 RR)
% Number of literals : 15 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 17 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-80hhsuu2/lgb.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
( big_f(X1,X2)
| big_f(esk1_2(X2,X1),esk1_2(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-80hhsuu2/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
~ big_f(esk1_2(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-80hhsuu2/lgb.p',i_0_1) ).
cnf(c_0_8,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
i_0_4 ).
cnf(c_0_9,negated_conjecture,
( big_f(X1,X2)
| big_f(esk1_2(X2,X1),esk1_2(X2,X1)) ),
i_0_3 ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
big_f(X1,X1),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
~ big_f(esk1_2(X1,X2),X2),
i_0_1 ).
cnf(c_0_13,negated_conjecture,
big_f(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN331+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 19:59:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.88/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.88/2.37 # No SInE strategy applied
% 7.88/2.37 # Trying AutoSched0 for 150 seconds
% 7.88/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.88/2.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.88/2.37 #
% 7.88/2.37 # Preprocessing time : 0.023 s
% 7.88/2.37 # Presaturation interreduction done
% 7.88/2.37
% 7.88/2.37 # Proof found!
% 7.88/2.37 # SZS status Theorem
% 7.88/2.37 # SZS output start CNFRefutation
% See solution above
% 7.88/2.37 # Training examples: 0 positive, 0 negative
% 7.88/2.37
% 7.88/2.37 # -------------------------------------------------
% 7.88/2.37 # User time : 0.021 s
% 7.88/2.37 # System time : 0.007 s
% 7.88/2.37 # Total time : 0.028 s
% 7.88/2.37 # Maximum resident set size: 7124 pages
% 7.88/2.37
%------------------------------------------------------------------------------