%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO655-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 : n010.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:21 PM UTC 2026
% Result : Unsatisfiable 0.22s 0.47s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 43 ( 9 unt; 21 nHn; 38 RR)
% Number of literals : 297 ( 0 equ; 232 neg)
% Maximal clause size : 24 ( 6 avg)
% Maximal term depth : 4 ( 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 : 76 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_379,axiom,
( ~ 'E'('0',f(X1))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| iLEQ(suc(X1),suc(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_379) ).
cnf(clause_84,axiom,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| iLEQ(suc(X1),suc(X1))
| 'E'(f(X1),f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_84) ).
cnf(clause_209,axiom,
( ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X4),suc(X2))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X1)))
| 'E'(f(X4),f(suc(X4)))
| 'E'(f(X5),f(suc(X5)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X2),f(suc(X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_209) ).
cnf(clause_125,axiom,
( ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'(f(X5),f(suc(X5)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X2),suc(X5))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(suc(X5))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_125) ).
cnf(clause_72,axiom,
( ~ 'LE'(f(suc(suc(X1))),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(suc(X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_72) ).
cnf(clause_5,axiom,
( ~ 'LE'(f(suc(X1)),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_513,axiom,
( ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_513) ).
cnf(clause_269,axiom,
~ 'LE'(f(z),'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_269) ).
cnf(clause_497,axiom,
'LE'(f(X1),s('0')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_497) ).
cnf(c_0_9,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| iLEQ(suc(X1),suc(X1)) ),
inference(fof_simplification,[status(thm)],[clause_379]) ).
cnf(c_0_10,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| iLEQ(suc(X1),suc(X1))
| 'E'(f(X1),f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_84]) ).
cnf(c_0_11,plain,
( ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X4),suc(X2))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X1)))
| 'E'(f(X4),f(suc(X4)))
| 'E'(f(X5),f(suc(X5)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X2),f(suc(X2))) ),
inference(fof_simplification,[status(thm)],[clause_209]) ).
cnf(c_0_12,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| iLEQ(suc(X1),suc(X1)) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X1))
| iLEQ(suc(X1),suc(X1))
| 'E'(f(X1),f(suc(X1))) ),
c_0_10 ).
cnf(c_0_14,plain,
( ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X1),suc(X5))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X4),suc(X2))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ iLEQ(suc(X2),suc(X1))
| ~ 'E'('0',f(suc(X1)))
| 'E'(f(X4),f(suc(X4)))
| 'E'(f(X5),f(suc(X5)))
| 'E'(f(X1),f(suc(X1)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X2),f(suc(X2))) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| iLEQ(suc(X1),suc(X1)) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ iLEQ(suc(X4),suc(X1))
| ~ iLEQ(suc(X3),suc(X4))
| ~ iLEQ(suc(X2),suc(X3))
| 'E'(f(X4),f(suc(X4)))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X1),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ iLEQ(suc(X1),suc(X3))
| ~ iLEQ(suc(X2),suc(X1))
| 'E'(f(X3),f(suc(X3)))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X1),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,plain,
( ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'(f(X5),f(suc(X5)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X2),suc(X5))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(suc(X5))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X1)))) ),
inference(fof_simplification,[status(thm)],[clause_125]) ).
cnf(c_0_19,plain,
( ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ iLEQ(suc(X2),suc(X1))
| 'E'(f(X2),f(suc(X2)))
| 'E'(f(X1),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_20,plain,
( ~ iLEQ(suc(X3),suc(X4))
| ~ 'E'(f(X4),f(suc(X4)))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(X5))
| ~ 'E'(f(X5),f(suc(X5)))
| ~ 'E'(f(X2),f(suc(X2)))
| ~ 'E'(f(X3),f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X1))
| ~ iLEQ(suc(X2),suc(X5))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'(f(X1),f(suc(X1)))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(suc(suc(X5))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(X2))
| ~ iLEQ(suc(X4),suc(X1))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(X3)))
| ~ iLEQ(suc(X1),suc(X2))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X1)))) ),
c_0_18 ).
cnf(c_0_21,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1))))
| 'E'(f(X1),f(suc(X1))) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,plain,
( ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X5))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X5)))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X5))))
| ~ iLEQ(suc(X2),suc(X4))
| ~ iLEQ(suc(X4),suc(X5))
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_23,plain,
( ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(X4))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(X4)))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ 'E'('0',f(suc(suc(X4))))
| ~ iLEQ(suc(X2),suc(X3))
| ~ iLEQ(suc(X3),suc(X4))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_24,plain,
( ~ 'LE'(f(suc(suc(X1))),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(suc(X1)))) ),
inference(fof_simplification,[status(thm)],[clause_72]) ).
cnf(c_0_25,plain,
( ~ 'LE'(f(suc(X1)),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_26,plain,
( ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_513]) ).
cnf(c_0_27,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X3))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X3)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X3))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ iLEQ(suc(X3),suc(X1))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_28,plain,
~ 'LE'(f(z),'0'),
inference(fof_simplification,[status(thm)],[clause_269]) ).
cnf(c_0_29,plain,
( ~ 'LE'(f(suc(suc(X1))),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(suc(X1)))) ),
c_0_24 ).
cnf(c_0_30,axiom,
'LE'(f(X1),s('0')),
clause_497 ).
cnf(c_0_31,plain,
( ~ 'LE'(f(suc(X1)),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(suc(X1))) ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ 'LE'(f(X1),s('0'))
| 'LE'(f(X1),'0')
| 'E'('0',f(X1)) ),
c_0_26 ).
cnf(c_0_33,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(X2))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(X2)))
| ~ 'E'('0',f(suc(suc(X1))))
| ~ 'E'('0',f(suc(suc(X2))))
| ~ iLEQ(suc(X1),suc(X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_34,plain,
~ 'LE'(f(z),'0'),
c_0_28 ).
cnf(c_0_35,plain,
( 'E'('0',f(suc(suc(X1))))
| 'LE'(f(X1),'0') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_36,plain,
( 'E'('0',f(suc(X1)))
| 'LE'(f(X1),'0') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_30])]) ).
cnf(c_0_37,plain,
( 'E'('0',f(X1))
| 'LE'(f(X1),'0') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_30])]) ).
cnf(c_0_38,plain,
( ~ 'E'('0',f(X1))
| ~ 'E'('0',f(suc(X1)))
| ~ 'E'('0',f(suc(suc(X1)))) ),
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_39,plain,
'E'('0',f(suc(suc(z)))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
'E'('0',f(suc(z))),
inference(spm,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_41,plain,
'E'('0',f(z)),
inference(spm,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO655-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.12/0.38 % Computer : n010.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 12:08:11 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.22/0.47 % Version: 3.5.1
% 0.22/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.47 % Starting sh5l with 300s (1) cores
% 0.22/0.47 % new_bool_3 with pid 833230 completed with status 9
% 0.22/0.47 % sh5l with pid 833232 completed with status 9
% 0.22/0.47 % new_bool_1 with pid 833231 completed with status 9
% 0.22/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 833229 completed with status 0
% 0.22/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.47 % No SInE strategy applied
% 0.22/0.47 % Search class: FGHNF-FSLF11-MFFFFFNN
% 0.22/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.22/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.22/0.47 % SubtermCWHack with pid 833247 completed with status 0
% 0.22/0.47 % Result found by SubtermCWHack
% 0.22/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.47 % No SInE strategy applied
% 0.22/0.47 % Search class: FGHNF-FSLF11-MFFFFFNN
% 0.22/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.47 % Preprocessing time : 0.002 s
% 0.22/0.47
% 0.22/0.47 % Proof found!
% 0.22/0.47 % SZS status Unsatisfiable
% 0.22/0.47 % SZS output start CNFRefutation
% See solution above
% 0.22/0.47 % Parsed axioms : 39
% 0.22/0.47 % Removed by relevancy pruning/SinE : 0
% 0.22/0.47 % Initial clauses : 39
% 0.22/0.47 % Removed in clause preprocessing : 0
% 0.22/0.47 % Initial clauses in saturation : 39
% 0.22/0.47 % Processed clauses : 81
% 0.22/0.47 % ...of these trivial : 0
% 0.22/0.47 % ...subsumed : 30
% 0.22/0.47 % ...remaining for further processing : 51
% 0.22/0.47 % Other redundant clauses eliminated : 0
% 0.22/0.47 % Clauses deleted for lack of memory : 0
% 0.22/0.47 % Backward-subsumed : 40
% 0.22/0.47 % Backward-rewritten : 0
% 0.22/0.47 % Generated clauses : 43
% 0.22/0.47 % ...of the previous two non-redundant : 42
% 0.22/0.47 % ...aggressively subsumed : 0
% 0.22/0.47 % Contextual simplify-reflections : 62
% 0.22/0.47 % Paramodulations : 43
% 0.22/0.47 % Factorizations : 0
% 0.22/0.47 % NegExts : 0
% 0.22/0.47 % Equation resolutions : 0
% 0.22/0.47 % Disequality decompositions : 0
% 0.22/0.47 % Total rewrite steps : 5
% 0.22/0.47 % ...of those cached : 0
% 0.22/0.47 % Propositional unsat checks : 0
% 0.22/0.47 % Propositional check models : 0
% 0.22/0.47 % Propositional check unsatisfiable : 0
% 0.22/0.47 % Propositional clauses : 0
% 0.22/0.47 % Propositional clauses after purity: 0
% 0.22/0.47 % Propositional unsat core size : 0
% 0.22/0.47 % Propositional preprocessing time : 0.000
% 0.22/0.47 % Propositional encoding time : 0.000
% 0.22/0.47 % Propositional solver time : 0.000
% 0.22/0.47 % Success case prop preproc time : 0.000
% 0.22/0.47 % Success case prop encoding time : 0.000
% 0.22/0.47 % Success case prop solver time : 0.000
% 0.22/0.47 % Current number of processed clauses : 11
% 0.22/0.47 % Positive orientable unit clauses : 4
% 0.22/0.47 % Positive unorientable unit clauses: 0
% 0.22/0.47 % Negative unit clauses : 1
% 0.22/0.47 % Non-unit-clauses : 6
% 0.22/0.47 % Current number of unprocessed clauses: 0
% 0.22/0.47 % ...number of literals in the above : 0
% 0.22/0.47 % Current number of archived formulas : 0
% 0.22/0.47 % Current number of archived clauses : 40
% 0.22/0.47 % Clause-clause subsumption calls (NU) : 1440
% 0.22/0.47 % Rec. Clause-clause subsumption calls : 1163
% 0.22/0.47 % Non-unit clause-clause subsumptions : 132
% 0.22/0.47 % Unit Clause-clause subsumption calls : 3
% 0.22/0.47 % Rewrite failures with RHS unbound : 0
% 0.22/0.47 % BW rewrite match attempts : 4
% 0.22/0.47 % BW rewrite match successes : 0
% 0.22/0.47 % Condensation attempts : 0
% 0.22/0.47 % Condensation successes : 0
% 0.22/0.47 % Termbank termtop insertions : 21068
% 0.22/0.47 % Search garbage collected termcells : 669
% 0.22/0.47
% 0.22/0.47 % -------------------------------------------------
% 0.22/0.47 % User time : 0.034 s
% 0.22/0.47 % System time : 0.002 s
% 0.22/0.47 % Total time : 0.036 s
% 0.22/0.47 % Maximum resident set size: 3732 pages
% 0.22/0.47
% 0.22/0.47 % -------------------------------------------------
% 0.22/0.47 % User time : 0.156 s
% 0.22/0.47 % System time : 0.056 s
% 0.22/0.47 % Total time : 0.212 s
% 0.22/0.47 % Maximum resident set size: 4608 pages
% 0.22/0.47 % E exiting
%------------------------------------------------------------------------------