%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO680-1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:48:26 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 74 ( 10 unt; 32 nHn; 60 RR)
% Number of literals : 258 ( 0 equ; 175 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 98 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_71,axiom,
( ~ 'E'(s(s(s('0'))),f(suc(X3)))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_71) ).
cnf(clause_14,axiom,
( ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).
cnf(clause_102,axiom,
( ~ 'LE'(f(suc(X1)),s(s(s(s('0')))))
| 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_102) ).
cnf(clause_127,axiom,
( ~ 'LE'(f(X1),s(s(s(s('0')))))
| 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_127) ).
cnf(clause_20,axiom,
( ~ 'E'(s(s('0')),f(X3))
| ~ 'E'(s(s('0')),f(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).
cnf(clause_5,axiom,
( ~ 'E'(s(s('0')),f(suc(X1)))
| ~ 'E'(s(s('0')),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_104,axiom,
'LE'(f(X1),s(s(s(s('0'))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_104) ).
cnf(clause_84,axiom,
( ~ 'LE'(f(suc(X1)),s(s(s('0'))))
| 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_84) ).
cnf(clause_51,axiom,
( ~ 'LE'(f(X1),s(s(s('0'))))
| 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_51) ).
cnf(clause_21,axiom,
( ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).
cnf(clause_91,axiom,
( ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_91) ).
cnf(clause_15,axiom,
( ~ 'LE'(f(suc(X1)),s(s('0')))
| 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
cnf(clause_6,axiom,
( ~ 'LE'(f(X1),s(s('0')))
| 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_144,axiom,
( ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_144) ).
cnf(clause_109,axiom,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| iLEQ(suc(X1),suc(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_109) ).
cnf(clause_114,axiom,
( ~ 'LE'(f(suc(X1)),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_114) ).
cnf(clause_96,axiom,
( ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_96) ).
cnf(clause_66,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_66) ).
cnf(c_0_18,plain,
( ~ 'E'(s(s(s('0'))),f(suc(X3)))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(fof_simplification,[status(thm)],[clause_71]) ).
cnf(c_0_19,plain,
( ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
inference(fof_simplification,[status(thm)],[clause_14]) ).
cnf(c_0_20,plain,
( ~ 'E'(s(s(s('0'))),f(suc(X3)))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(X3))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(X2))
| ~ iLEQ(suc(X1),suc(X2)) ),
c_0_18 ).
cnf(c_0_21,plain,
( ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ 'E'(s(s(s('0'))),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
c_0_19 ).
cnf(c_0_22,plain,
( ~ 'LE'(f(suc(X1)),s(s(s(s('0')))))
| 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_102]) ).
cnf(c_0_23,plain,
( ~ 'LE'(f(X1),s(s(s(s('0')))))
| 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_127]) ).
cnf(c_0_24,plain,
( ~ 'E'(s(s('0')),f(X3))
| ~ 'E'(s(s('0')),f(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_20]) ).
cnf(c_0_25,plain,
( ~ 'E'(s(s('0')),f(suc(X1)))
| ~ 'E'(s(s('0')),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_26,plain,
( ~ 'E'(s(s(s('0'))),f(X2))
| ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(suc(X2)))
| ~ 'E'(s(s(s('0'))),f(suc(X1)))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ 'LE'(f(suc(X1)),s(s(s(s('0')))))
| 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(suc(X1))) ),
c_0_22 ).
cnf(c_0_28,axiom,
'LE'(f(X1),s(s(s(s('0'))))),
clause_104 ).
cnf(c_0_29,plain,
( ~ 'LE'(f(X1),s(s(s(s('0')))))
| 'LE'(f(X1),s(s(s('0'))))
| 'E'(s(s(s('0'))),f(X1)) ),
c_0_23 ).
cnf(c_0_30,plain,
( ~ 'E'(s(s('0')),f(X3))
| ~ 'E'(s(s('0')),f(X2))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ 'E'(s(s('0')),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X1))) ),
c_0_24 ).
cnf(c_0_31,plain,
( ~ 'E'(s(s('0')),f(suc(X1)))
| ~ 'E'(s(s('0')),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ 'LE'(f(suc(X1)),s(s(s('0'))))
| 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_84]) ).
cnf(c_0_33,plain,
( ~ 'E'(s(s(s('0'))),f(X1))
| ~ 'E'(s(s(s('0'))),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_34,plain,
( 'E'(s(s(s('0'))),f(suc(X1)))
| 'LE'(f(X1),s(s(s('0')))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_35,plain,
( 'E'(s(s(s('0'))),f(X1))
| 'LE'(f(X1),s(s(s('0')))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28])]) ).
cnf(c_0_36,plain,
( ~ 'LE'(f(X1),s(s(s('0'))))
| 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_51]) ).
cnf(c_0_37,plain,
( ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(fof_simplification,[status(thm)],[clause_21]) ).
cnf(c_0_38,plain,
( ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
inference(fof_simplification,[status(thm)],[clause_91]) ).
cnf(c_0_39,plain,
( ~ 'E'(s(s('0')),f(X2))
| ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X2)))
| ~ 'E'(s(s('0')),f(suc(X1)))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,plain,
( ~ 'LE'(f(suc(X1)),s(s(s('0'))))
| 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(suc(X1))) ),
c_0_32 ).
cnf(c_0_41,plain,
'LE'(f(X1),s(s(s('0')))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_42,plain,
( ~ 'LE'(f(X1),s(s(s('0'))))
| 'LE'(f(X1),s(s('0')))
| 'E'(s(s('0')),f(X1)) ),
c_0_36 ).
cnf(c_0_43,plain,
( ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(X3))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ 'E'(s('0'),f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2)) ),
c_0_37 ).
cnf(c_0_44,plain,
( ~ 'E'(s('0'),f(suc(X1)))
| ~ 'E'(s('0'),f(X1))
| iLEQ(suc(X1),suc(X1)) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ 'LE'(f(suc(X1)),s(s('0')))
| 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_15]) ).
cnf(c_0_46,plain,
( ~ 'E'(s(s('0')),f(X1))
| ~ 'E'(s(s('0')),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_47,plain,
( 'E'(s(s('0')),f(suc(X1)))
| 'LE'(f(X1),s(s('0'))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_48,plain,
( 'E'(s(s('0')),f(X1))
| 'LE'(f(X1),s(s('0'))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_41])]) ).
cnf(c_0_49,plain,
( ~ 'LE'(f(X1),s(s('0')))
| 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_50,plain,
( ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_144]) ).
cnf(c_0_51,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| iLEQ(suc(X1),suc(X1)) ),
inference(fof_simplification,[status(thm)],[clause_109]) ).
cnf(c_0_52,plain,
( ~ 'E'(s('0'),f(X2))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X2)))
| ~ 'E'(s('0'),f(suc(X1)))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_53,plain,
( ~ 'LE'(f(suc(X1)),s(s('0')))
| 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(suc(X1))) ),
c_0_45 ).
cnf(c_0_54,plain,
'LE'(f(X1),s(s('0'))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_55,plain,
( ~ 'LE'(f(X1),s(s('0')))
| 'LE'(f(X1),s('0'))
| 'E'(s('0'),f(X1)) ),
c_0_49 ).
cnf(c_0_56,plain,
( ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X1))) ),
c_0_50 ).
cnf(c_0_57,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| iLEQ(suc(X1),suc(X1)) ),
c_0_51 ).
cnf(c_0_58,plain,
( ~ 'LE'(f(suc(X1)),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_114]) ).
cnf(c_0_59,plain,
( ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_44]) ).
cnf(c_0_60,plain,
( 'E'(s('0'),f(suc(X1)))
| 'LE'(f(X1),s('0')) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_61,plain,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0')) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54])]) ).
cnf(c_0_62,plain,
( ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_96]) ).
cnf(c_0_63,plain,
( ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X1)))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,plain,
( ~ 'LE'(f(suc(X1)),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
c_0_58 ).
cnf(c_0_65,plain,
'LE'(f(X1),s('0')),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_66,plain,
( ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
c_0_62 ).
cnf(c_0_67,plain,
~ 'LE'(f(z),'0'),
inference(fof_simplification,[status(thm)],[clause_66]) ).
cnf(c_0_68,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_63,c_0_57]) ).
cnf(c_0_69,plain,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_70,plain,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_65])]) ).
cnf(c_0_71,plain,
~ 'LE'(f(z),'0'),
c_0_67 ).
cnf(c_0_72,plain,
'LE'(f(X1),'0'),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_73,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO680-1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n017.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 12:04:17 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2273514 completed with status 0
% 0.15/5.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.46 % No SInE strategy applied
% 0.15/5.46 % Search class: FGHNF-FFMF11-MFFFFFNN
% 0.15/5.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 2273521 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.46 % No SInE strategy applied
% 0.15/5.46 % Search class: FGHNF-FFMF11-MFFFFFNN
% 0.15/5.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.46 % Preprocessing time : 0.001 s
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Unsatisfiable
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 18
% 0.15/5.46 % Removed by relevancy pruning/SinE : 0
% 0.15/5.46 % Initial clauses : 18
% 0.15/5.46 % Removed in clause preprocessing : 0
% 0.15/5.46 % Initial clauses in saturation : 18
% 0.15/5.46 % Processed clauses : 42
% 0.15/5.46 % ...of these trivial : 0
% 0.15/5.46 % ...subsumed : 0
% 0.15/5.46 % ...remaining for further processing : 42
% 0.15/5.46 % Other redundant clauses eliminated : 0
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 21
% 0.15/5.46 % Backward-rewritten : 11
% 0.15/5.46 % Generated clauses : 38
% 0.15/5.46 % ...of the previous two non-redundant : 44
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 4
% 0.15/5.46 % Paramodulations : 38
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 0
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 13
% 0.15/5.46 % ...of those cached : 3
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 10
% 0.15/5.46 % Positive orientable unit clauses : 6
% 0.15/5.46 % Positive unorientable unit clauses: 0
% 0.15/5.46 % Negative unit clauses : 0
% 0.15/5.46 % Non-unit-clauses : 4
% 0.15/5.46 % Current number of unprocessed clauses: 8
% 0.15/5.46 % ...number of literals in the above : 29
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 32
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 196
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 66
% 0.15/5.46 % Non-unit clause-clause subsumptions : 21
% 0.15/5.46 % Unit Clause-clause subsumption calls : 12
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 13
% 0.15/5.46 % BW rewrite match successes : 8
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 3309
% 0.15/5.46 % Search garbage collected termcells : 102
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.005 s
% 0.15/5.46 % System time : 0.005 s
% 0.15/5.46 % Total time : 0.009 s
% 0.15/5.46 % Maximum resident set size: 3652 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.025 s
% 0.15/5.46 % System time : 0.015 s
% 0.15/5.46 % Total time : 0.041 s
% 0.15/5.46 % Maximum resident set size: 4608 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------