%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN039-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:22:31 PM UTC 2026
% Result : Unsatisfiable 4.38s 1.06s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 11
% Syntax : Number of clauses : 76 ( 3 unt; 51 nHn; 12 RR)
% Number of literals : 253 ( 0 equ; 69 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 391 ( 222 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_14,negated_conjecture,
( ~ p(X1,X1)
| q(f1(X1,X2),X4)
| s(f1(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_14) ).
cnf(c_20,negated_conjecture,
( ~ s(X2,f1(X2,X3))
| q(f1(X2,X3),X4)
| s(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_20) ).
cnf(c_5,negated_conjecture,
( q(f1(X1,X2),X4)
| s(f1(X1,X2),X3)
| p(f1(X1,X2),f1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_5) ).
cnf(c_26,negated_conjecture,
( ~ q(X3,X3)
| q(f1(X2,X4),X3)
| s(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_26) ).
cnf(c_9,negated_conjecture,
( ~ s(X2,X2)
| ~ q(X3,X3)
| p(f1(X1,X2),f1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_9) ).
cnf(c_18,negated_conjecture,
( ~ s(X3,X3)
| ~ q(X2,X2)
| ~ p(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_18) ).
cnf(c_13,negated_conjecture,
( ~ q(X2,f1(X1,X2))
| ~ p(X1,X1)
| s(f1(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_13) ).
cnf(c_25,negated_conjecture,
( ~ q(X4,f1(X2,X4))
| ~ q(X3,X3)
| s(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_25) ).
cnf(c_21,negated_conjecture,
( ~ s(X3,X3)
| ~ s(X2,f1(X2,X3))
| s(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_21) ).
cnf(c_12,negated_conjecture,
( ~ s(X2,X2)
| ~ s(X1,f1(X1,X2))
| ~ p(X1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_12) ).
cnf(c_3,negated_conjecture,
( ~ s(X2,X2)
| ~ s(X1,f1(X1,X2))
| p(f1(X1,X2),f1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_3) ).
cnf(c_0_11,negated_conjecture,
( ~ p(X1,X1)
| q(f1(X1,X2),X4)
| s(f1(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[c_14]) ).
cnf(c_0_12,negated_conjecture,
( ~ s(X2,f1(X2,X3))
| q(f1(X2,X3),X4)
| s(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_20]) ).
cnf(c_0_13,negated_conjecture,
( ~ p(X1,X1)
| q(f1(X1,X2),X4)
| s(f1(X1,X2),X3) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
( q(f1(X1,X2),X4)
| s(f1(X1,X2),X3)
| p(f1(X1,X2),f1(X1,X2)) ),
c_5 ).
cnf(c_0_15,negated_conjecture,
( ~ s(X2,f1(X2,X3))
| q(f1(X2,X3),X4)
| s(X1,X2) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
( s(f1(X1,X2),X7)
| s(f1(f1(X1,X2),X3),X6)
| q(f1(X1,X2),X5)
| q(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( s(X9,f1(X1,X2))
| s(f1(f1(X1,X2),X3),X8)
| q(f1(X1,X2),X7)
| q(f1(f1(X1,X2),X5),X6)
| q(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( s(X7,f1(X1,X2))
| s(f1(f1(X1,X2),X3),X6)
| q(f1(X1,X2),X5)
| q(f1(f1(X1,X2),X3),X4) ),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ q(X3,X3)
| q(f1(X2,X4),X3)
| s(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_26]) ).
cnf(c_0_20,negated_conjecture,
( s(X8,X1)
| s(f1(f1(X1,X2),X3),X7)
| q(f1(X1,X2),X6)
| q(f1(X1,X2),X5)
| q(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ s(X2,X2)
| ~ q(X3,X3)
| p(f1(X1,X2),f1(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_9]) ).
cnf(c_0_22,negated_conjecture,
( ~ s(X3,X3)
| ~ q(X2,X2)
| ~ p(X1,X1) ),
inference(fof_simplification,[status(thm)],[c_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ q(X3,X3)
| q(f1(X2,X4),X3)
| s(X1,X2) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
( s(X7,X1)
| s(f1(f1(X1,X2),X3),X6)
| q(f1(X1,X2),X5)
| q(f1(f1(X1,X2),X3),X4) ),
inference(ef,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ s(X2,X2)
| ~ q(X3,X3)
| p(f1(X1,X2),f1(X1,X2)) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
( ~ s(X3,X3)
| ~ q(X2,X2)
| ~ p(X1,X1) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
( s(X9,X1)
| s(X8,X3)
| s(f1(f1(X3,X4),X5),X7)
| q(f1(X3,X4),X6)
| q(f1(X1,X2),f1(f1(X3,X4),X5)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ s(X2,X2)
| ~ q(X1,X1) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( s(X6,X1)
| s(X5,X1)
| s(f1(f1(X1,X2),X3),X4)
| q(f1(X1,X2),f1(f1(X1,X2),X3)) ),
inference(ef,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( ~ s(X7,X7)
| s(X6,X1)
| s(f1(f1(X1,X2),X4),X5)
| q(f1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( s(X5,X1)
| s(f1(f1(X1,X2),X3),X4)
| q(f1(X1,X2),f1(f1(X1,X2),X3)) ),
inference(ef,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( s(X10,X4)
| s(X9,X1)
| s(f1(f1(X4,X5),X7),X8)
| q(f1(X4,X5),X6)
| q(f1(X1,X2),f1(f1(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( ~ q(X2,f1(X1,X2))
| ~ p(X1,X1)
| s(f1(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[c_13]) ).
cnf(c_0_34,negated_conjecture,
( s(X7,X1)
| s(X6,X1)
| s(f1(f1(X1,X2),X4),X5)
| q(f1(X1,X2),f1(f1(X1,X2),X3)) ),
inference(ef,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( ~ q(X2,f1(X1,X2))
| ~ p(X1,X1)
| s(f1(X1,X2),X3) ),
c_0_33 ).
cnf(c_0_36,negated_conjecture,
( s(X6,X1)
| s(f1(f1(X1,X2),X4),X5)
| q(f1(X1,X2),f1(f1(X1,X2),X3)) ),
inference(ef,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ p(f1(X1,X2),f1(X1,X2))
| s(X6,X1)
| s(f1(f1(X1,X2),X4),X5)
| s(f1(f1(X1,X2),f1(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
( s(X8,X1)
| s(f1(X1,X2),X7)
| s(f1(f1(X1,X2),X5),X6)
| s(f1(f1(X1,X2),f1(X1,X2)),X4)
| q(f1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_39,negated_conjecture,
( s(X6,X1)
| s(f1(X1,X2),X5)
| s(f1(f1(X1,X2),f1(X1,X2)),X4)
| q(f1(X1,X2),X3) ),
inference(ef,[status(thm)],[c_0_38]) ).
cnf(c_0_40,negated_conjecture,
( s(X11,X4)
| s(X10,X1)
| s(f1(X1,X2),X9)
| s(f1(f1(X4,X5),X7),X8)
| q(f1(X4,X5),X6)
| q(f1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( s(X8,X1)
| s(X7,X1)
| s(f1(X1,X2),X6)
| s(f1(f1(X1,X2),X4),X5)
| q(f1(X1,X2),X3) ),
inference(ef,[status(thm)],[c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( s(X7,X1)
| s(f1(X1,X2),X6)
| s(f1(f1(X1,X2),X4),X5)
| q(f1(X1,X2),X3) ),
inference(ef,[status(thm)],[c_0_41]) ).
cnf(c_0_43,negated_conjecture,
( ~ s(X7,X7)
| s(X6,X1)
| s(f1(X1,X2),X5)
| s(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( s(X11,X4)
| s(X10,X1)
| s(f1(X4,X5),X9)
| s(f1(X1,X2),X8)
| s(f1(f1(X4,X5),X6),X7)
| q(f1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( s(X9,X4)
| s(f1(X1,X2),X8)
| s(f1(X4,X5),X1)
| s(f1(f1(X4,X5),X6),X7)
| q(f1(X1,X2),X3) ),
inference(ef,[status(thm)],[c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ~ s(X7,X7)
| s(X6,X1)
| s(f1(f1(X1,X2),X3),X5)
| q(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_47,negated_conjecture,
( s(X6,X1)
| s(f1(f1(X1,X2),X3),X5)
| q(f1(f1(X1,X2),X3),X4) ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_45]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( ~ q(X4,f1(X2,X4))
| ~ q(X3,X3)
| s(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_25]) ).
cnf(c_0_49,negated_conjecture,
( ~ s(X6,X6)
| s(X5,X1)
| s(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ q(X4,f1(X2,X4))
| ~ q(X3,X3)
| s(X1,X2) ),
c_0_48 ).
cnf(c_0_51,negated_conjecture,
( s(X10,X5)
| s(X9,X1)
| s(f1(f1(X5,X6),X7),X8)
| q(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_49,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( ~ q(X8,X8)
| s(X6,X7)
| s(X5,X1)
| s(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_50,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( s(X8,X5)
| s(f1(f1(X5,X6),X7),X1)
| q(f1(f1(X1,X2),X3),X4) ),
inference(ef,[status(thm)],[c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( s(X12,X5)
| s(X10,X11)
| s(X9,X1)
| s(f1(f1(X5,X6),X7),X8)
| s(f1(f1(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
( s(X8,X1)
| s(X6,X7)
| s(X5,X1)
| s(f1(f1(X1,X2),X3),X4) ),
inference(ef,[status(thm)],[c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( ~ s(X3,X3)
| ~ s(X2,f1(X2,X3))
| s(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_21]) ).
cnf(c_0_57,negated_conjecture,
( s(X6,X1)
| s(X5,X1)
| s(f1(f1(X1,X2),X3),X4) ),
inference(ef,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( ~ s(X3,X3)
| ~ s(X2,f1(X2,X3))
| s(X1,X2) ),
c_0_56 ).
cnf(c_0_59,negated_conjecture,
( s(X5,X1)
| s(f1(f1(X1,X2),X3),X4) ),
inference(ef,[status(thm)],[c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( ~ s(X6,X6)
| s(X5,X2)
| s(X1,f1(f1(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,negated_conjecture,
( s(X7,X2)
| s(X5,X6)
| s(X1,f1(f1(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
( s(X5,X2)
| s(X1,f1(f1(X2,X3),X4)) ),
inference(ef,[status(thm)],[c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( ~ s(X5,X5)
| s(X4,X2)
| s(X1,f1(X2,X3)) ),
inference(spm,[status(thm)],[c_0_58,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
( s(X6,X2)
| s(X4,X5)
| s(X1,f1(X2,X3)) ),
inference(spm,[status(thm)],[c_0_63,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( s(X4,X2)
| s(X1,f1(X2,X3)) ),
inference(ef,[status(thm)],[c_0_64]) ).
cnf(c_0_66,negated_conjecture,
( ~ s(X4,X4)
| s(X3,X2)
| s(X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( s(X5,X4)
| s(X3,X4)
| s(X1,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( ~ s(X2,X2)
| ~ s(X1,f1(X1,X2))
| ~ p(X1,X1) ),
inference(fof_simplification,[status(thm)],[c_12]) ).
cnf(c_0_69,negated_conjecture,
( s(X3,X2)
| s(X1,X2) ),
inference(ef,[status(thm)],[c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( ~ s(X2,X2)
| ~ s(X1,f1(X1,X2))
| p(f1(X1,X2),f1(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_3]) ).
cnf(c_0_71,negated_conjecture,
( ~ s(X2,X2)
| ~ s(X1,f1(X1,X2))
| ~ p(X1,X1) ),
c_0_68 ).
cnf(c_0_72,negated_conjecture,
s(X1,X2),
inference(ef,[status(thm)],[c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( ~ s(X2,X2)
| ~ s(X1,f1(X1,X2))
| p(f1(X1,X2),f1(X1,X2)) ),
c_0_70 ).
cnf(c_0_74,negated_conjecture,
~ p(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_72])]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_72]),c_0_72])]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN039-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:39:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 4.38/1.06 % Version: 3.5.1
% 4.38/1.06 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.38/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.38/1.06 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.38/1.06 % Starting new_bool_3 with 300s (1) cores
% 4.38/1.06 % Starting new_bool_1 with 300s (1) cores
% 4.38/1.06 % Starting sh5l with 300s (1) cores
% 4.38/1.06 % new_bool_3 with pid 563904 completed with status 0
% 4.38/1.06 % Result found by new_bool_3
% 4.38/1.06 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.38/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.38/1.06 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.38/1.06 % Starting new_bool_3 with 300s (1) cores
% 4.38/1.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.38/1.06 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.38/1.06 % Search class: FGHNF-FFMF22-SFFFFFNN
% 4.38/1.06 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.38/1.06 % Starting SubtermCWHack with 31s (1) cores
% 4.38/1.06 % SubtermCWHack with pid 563910 completed with status 0
% 4.38/1.06 % Result found by SubtermCWHack
% 4.38/1.06 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.38/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.38/1.06 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.38/1.06 % Starting new_bool_3 with 300s (1) cores
% 4.38/1.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.38/1.06 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.38/1.06 % Search class: FGHNF-FFMF22-SFFFFFNN
% 4.38/1.06 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.38/1.06 % Starting SubtermCWHack with 31s (1) cores
% 4.38/1.06 % Preprocessing time : 0.001 s
% 4.38/1.06
% 4.38/1.06 % Proof found!
% 4.38/1.06 % SZS status Unsatisfiable
% 4.38/1.06 % SZS output start CNFRefutation
% See solution above
% 4.38/1.06 % Parsed axioms : 27
% 4.38/1.06 % Removed by relevancy pruning/SinE : 0
% 4.38/1.06 % Initial clauses : 27
% 4.38/1.06 % Removed in clause preprocessing : 0
% 4.38/1.06 % Initial clauses in saturation : 27
% 4.38/1.06 % Processed clauses : 1158
% 4.38/1.06 % ...of these trivial : 4
% 4.38/1.06 % ...subsumed : 496
% 4.38/1.06 % ...remaining for further processing : 657
% 4.38/1.06 % Other redundant clauses eliminated : 0
% 4.38/1.06 % Clauses deleted for lack of memory : 0
% 4.38/1.06 % Backward-subsumed : 448
% 4.38/1.06 % Backward-rewritten : 205
% 4.38/1.06 % Generated clauses : 57995
% 4.38/1.06 % ...of the previous two non-redundant : 55778
% 4.38/1.06 % ...aggressively subsumed : 0
% 4.38/1.06 % Contextual simplify-reflections : 8
% 4.38/1.06 % Paramodulations : 57182
% 4.38/1.06 % Factorizations : 812
% 4.38/1.06 % NegExts : 0
% 4.38/1.06 % Equation resolutions : 0
% 4.38/1.06 % Disequality decompositions : 0
% 4.38/1.06 % Total rewrite steps : 2284
% 4.38/1.06 % ...of those cached : 1828
% 4.38/1.06 % Propositional unsat checks : 0
% 4.38/1.06 % Propositional check models : 0
% 4.38/1.06 % Propositional check unsatisfiable : 0
% 4.38/1.06 % Propositional clauses : 0
% 4.38/1.06 % Propositional clauses after purity: 0
% 4.38/1.06 % Propositional unsat core size : 0
% 4.38/1.06 % Propositional preprocessing time : 0.000
% 4.38/1.06 % Propositional encoding time : 0.000
% 4.38/1.06 % Propositional solver time : 0.000
% 4.38/1.06 % Success case prop preproc time : 0.000
% 4.38/1.06 % Success case prop encoding time : 0.000
% 4.38/1.06 % Success case prop solver time : 0.000
% 4.38/1.06 % Current number of processed clauses : 3
% 4.38/1.06 % Positive orientable unit clauses : 1
% 4.38/1.06 % Positive unorientable unit clauses: 0
% 4.38/1.06 % Negative unit clauses : 2
% 4.38/1.06 % Non-unit-clauses : 0
% 4.38/1.06 % Current number of unprocessed clauses: 53569
% 4.38/1.06 % ...number of literals in the above : 390892
% 4.38/1.06 % Current number of archived formulas : 0
% 4.38/1.06 % Current number of archived clauses : 654
% 4.38/1.06 % Clause-clause subsumption calls (NU) : 39159
% 4.38/1.06 % Rec. Clause-clause subsumption calls : 12649
% 4.38/1.06 % Non-unit clause-clause subsumptions : 914
% 4.38/1.06 % Unit Clause-clause subsumption calls : 237
% 4.38/1.06 % Rewrite failures with RHS unbound : 0
% 4.38/1.06 % BW rewrite match attempts : 197
% 4.38/1.06 % BW rewrite match successes : 165
% 4.38/1.06 % Condensation attempts : 0
% 4.38/1.06 % Condensation successes : 0
% 4.38/1.06 % Termbank termtop insertions : 1435774
% 4.38/1.06 % Search garbage collected termcells : 58
% 4.38/1.06
% 4.38/1.06 % -------------------------------------------------
% 4.38/1.06 % User time : 0.593 s
% 4.38/1.06 % System time : 0.023 s
% 4.38/1.06 % Total time : 0.616 s
% 4.38/1.06 % Maximum resident set size: 3644 pages
% 4.38/1.06
% 4.38/1.06 % -------------------------------------------------
% 4.38/1.06 % User time : 0.595 s
% 4.38/1.06 % System time : 0.027 s
% 4.38/1.06 % Total time : 0.622 s
% 4.38/1.06 % Maximum resident set size: 4864 pages
% 4.38/1.06 % E exiting
%------------------------------------------------------------------------------