%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV221+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 02:53:59 PM UTC 2026
% Result : Theorem 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 294 ( 54 equ)
% Maximal formula atoms : 51 ( 9 avg)
% Number of connectives : 338 ( 75 ~; 62 |; 148 &)
% ( 2 <=>; 51 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-3 aty)
% Number of variables : 92 ( 0 sgn 80 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0401,conjecture,
( ( ! [X16] :
( ( leq(X16,pred(pv57))
& leq(n0,X16) )
=> ! [X6] :
( ( leq(X6,n5)
& leq(n0,X6) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) )
& ! [X5,X11] :
( ( leq(X11,n5)
& leq(X5,n5)
& leq(n0,X11)
& leq(n0,X5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X28,X29] :
( ( leq(X29,n5)
& leq(X28,n5)
& leq(n0,X29)
& leq(n0,X28) )
=> ( ( gt(pv58,X29)
& X28 = pv57 )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& gt(pv58,pv57)
& leq(pv58,n5)
& leq(pv57,n5)
& leq(pv5,n998)
& leq(n0,pv57)
& leq(n0,pv5) )
=> ! [X19] :
( ( leq(X19,pred(pv57))
& leq(n0,X19) )
=> ! [X15] :
( ( leq(X15,n5)
& leq(n0,X15) )
=> ( ( pv57 != X19
& ~ ( X15 = X19
& pv57 = X15 ) )
=> a_select3(id_ds1_filter,X19,X15) = a_select3(id_ds1_filter,X15,X19) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0401) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(transitivity_leq,axiom,
! [X1,X2,X3] :
( ( leq(X2,X3)
& leq(X1,X2) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(leq_gt1,axiom,
! [X1,X2] :
( gt(X2,X1)
=> leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(c_0_4,plain,
( epred1_0
<=> ( ! [X16] :
( ( leq(X16,pred(pv57))
& leq(n0,X16) )
=> ! [X6] :
( ( leq(X6,n5)
& leq(n0,X6) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) )
& ! [X5,X11] :
( ( leq(X11,n5)
& leq(X5,n5)
& leq(n0,X11)
& leq(n0,X5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X28,X29] :
( ( leq(X29,n5)
& leq(X28,n5)
& leq(n0,X29)
& leq(n0,X28) )
=> ( ( gt(pv58,X29)
& X28 = pv57 )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& gt(pv58,pv57)
& leq(pv58,n5)
& leq(pv57,n5)
& leq(pv5,n998)
& leq(n0,pv57)
& leq(n0,pv5) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ( ( ! [X16] :
( ( leq(X16,pred(pv57))
& leq(n0,X16) )
=> ! [X6] :
( ( leq(X6,n5)
& leq(n0,X6) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) )
& ! [X5,X11] :
( ( leq(X11,n5)
& leq(X5,n5)
& leq(n0,X11)
& leq(n0,X5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X28,X29] :
( ( leq(X29,n5)
& leq(X28,n5)
& leq(n0,X29)
& leq(n0,X28) )
=> ( ( gt(pv58,X29)
& X28 = pv57 )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& gt(pv58,pv57)
& leq(pv58,n5)
& leq(pv57,n5)
& leq(pv5,n998)
& leq(n0,pv57)
& leq(n0,pv5) )
=> ! [X19] :
( ( leq(X19,pred(pv57))
& leq(n0,X19) )
=> ! [X15] :
( ( leq(X15,n5)
& leq(n0,X15) )
=> ( ( pv57 != X19
& ~ ( X15 = X19
& pv57 = X15 ) )
=> a_select3(id_ds1_filter,X19,X15) = a_select3(id_ds1_filter,X15,X19) ) ) ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0401]) ).
fof(c_0_6,plain,
( epred1_0
=> ( ! [X16] :
( ( leq(X16,pred(pv57))
& leq(n0,X16) )
=> ! [X6] :
( ( leq(X6,n5)
& leq(n0,X6) )
=> a_select3(id_ds1_filter,X16,X6) = a_select3(id_ds1_filter,X6,X16) ) )
& ! [X5,X11] :
( ( leq(X11,n5)
& leq(X5,n5)
& leq(n0,X11)
& leq(n0,X5) )
=> ( gt(pv57,X5)
=> a_select3(id_ds1_filter,X5,X11) = a_select3(id_ds1_filter,X11,X5) ) )
& ! [X28,X29] :
( ( leq(X29,n5)
& leq(X28,n5)
& leq(n0,X29)
& leq(n0,X28) )
=> ( ( gt(pv58,X29)
& X28 = pv57 )
=> a_select3(id_ds1_filter,X28,X29) = a_select3(id_ds1_filter,X29,X28) ) )
& ! [X21,X22] :
( ( leq(X22,n5)
& leq(X21,n5)
& leq(n0,X22)
& leq(n0,X21) )
=> a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
& ! [X4,X20] :
( ( leq(X20,n2)
& leq(X4,n2)
& leq(n0,X20)
& leq(n0,X4) )
=> a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
& ! [X14,X18] :
( ( leq(X18,n5)
& leq(X14,n5)
& leq(n0,X18)
& leq(n0,X14) )
=> a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
& gt(pv58,pv57)
& leq(pv58,n5)
& leq(pv57,n5)
& leq(pv5,n998)
& leq(n0,pv57)
& leq(n0,pv5) ) ),
inference(split_equiv,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( ( leq(X19,pred(pv57))
& leq(n0,X19) )
=> ! [X15] :
( ( leq(X15,n5)
& leq(n0,X15) )
=> ( ( pv57 != X19
& ~ ( X15 = X19
& pv57 = X15 ) )
=> a_select3(id_ds1_filter,X19,X15) = a_select3(id_ds1_filter,X15,X19) ) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5]),c_0_4]) ).
fof(c_0_8,plain,
! [X75,X76,X77,X78,X79,X80,X81,X82,X83,X84,X85,X86] :
( ( ~ epred1_0
| a_select3(id_ds1_filter,X85,X86) = a_select3(id_ds1_filter,X86,X85)
| ~ leq(X86,n5)
| ~ leq(n0,X86)
| ~ leq(X85,pred(pv57))
| ~ leq(n0,X85) )
& ( ~ epred1_0
| a_select3(id_ds1_filter,X83,X84) = a_select3(id_ds1_filter,X84,X83)
| ~ gt(pv57,X83)
| ~ leq(X84,n5)
| ~ leq(X83,n5)
| ~ leq(n0,X84)
| ~ leq(n0,X83) )
& ( ~ epred1_0
| a_select3(id_ds1_filter,X81,X82) = a_select3(id_ds1_filter,X82,X81)
| ~ gt(pv58,X82)
| X81 != pv57
| ~ leq(X82,n5)
| ~ leq(X81,n5)
| ~ leq(n0,X82)
| ~ leq(n0,X81) )
& ( ~ epred1_0
| a_select3(pminus_ds1_filter,X79,X80) = a_select3(pminus_ds1_filter,X80,X79)
| ~ leq(X80,n5)
| ~ leq(X79,n5)
| ~ leq(n0,X80)
| ~ leq(n0,X79) )
& ( ~ epred1_0
| a_select3(r_ds1_filter,X77,X78) = a_select3(r_ds1_filter,X78,X77)
| ~ leq(X78,n2)
| ~ leq(X77,n2)
| ~ leq(n0,X78)
| ~ leq(n0,X77) )
& ( ~ epred1_0
| a_select3(q_ds1_filter,X75,X76) = a_select3(q_ds1_filter,X76,X75)
| ~ leq(X76,n5)
| ~ leq(X75,n5)
| ~ leq(n0,X76)
| ~ leq(n0,X75) )
& ( ~ epred1_0
| gt(pv58,pv57) )
& ( ~ epred1_0
| leq(pv58,n5) )
& ( ~ epred1_0
| leq(pv57,n5) )
& ( ~ epred1_0
| leq(pv5,n998) )
& ( ~ epred1_0
| leq(n0,pv57) )
& ( ~ epred1_0
| leq(n0,pv5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,negated_conjecture,
( a_select3(id_ds1_filter,esk1_0,esk2_0) != a_select3(id_ds1_filter,esk2_0,esk1_0)
& pv57 != esk1_0
& ( esk2_0 != esk1_0
| pv57 != esk2_0 )
& leq(esk2_0,n5)
& leq(n0,esk2_0)
& leq(esk1_0,pred(pv57))
& leq(n0,esk1_0)
& epred1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X52,X53] :
( ( leq(X52,pred(X53))
| ~ gt(X53,X52) )
& ( gt(X53,X52)
| ~ leq(X52,pred(X53)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_11,plain,
! [X33,X34,X35] :
( leq(X33,X35)
| ~ leq(X34,X35)
| ~ leq(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_leq])])]) ).
cnf(c_0_12,plain,
( ~ epred1_0
| leq(pv57,n5) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X36,X37] :
( leq(X36,X37)
| ~ gt(X37,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt1])])]) ).
cnf(c_0_15,plain,
( ~ leq(X1,pred(X2))
| gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
leq(esk1_0,pred(pv57)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ epred1_0
| ~ gt(pv57,X1)
| ~ leq(X2,n5)
| ~ leq(X1,n5)
| ~ leq(n0,X2)
| ~ leq(n0,X1)
| a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
leq(pv57,n5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_20,plain,
( ~ gt(X1,X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
gt(pv57,esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
a_select3(id_ds1_filter,esk1_0,esk2_0) != a_select3(id_ds1_filter,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ gt(pv57,X1)
| ~ leq(n0,X1)
| ~ leq(n0,X2)
| ~ leq(X1,n5)
| ~ leq(X2,n5)
| a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13])]) ).
cnf(c_0_24,negated_conjecture,
leq(esk2_0,n5),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
leq(n0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
leq(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( ~ leq(X1,pv57)
| leq(X1,n5) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
leq(esk1_0,pv57),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
~ leq(esk1_0,n5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_21])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV221+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:34:55 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % new_bool_3 with pid 1475735 completed with status 0
% 0.14/0.46 % Result found by new_bool_3
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/0.46 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.46 % SubtermCWHack with pid 1475738 completed with status 0
% 0.14/0.46 % Result found by SubtermCWHack
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.46 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.14/0.46 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.46 % Preprocessing time : 0.002 s
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Theorem
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 92
% 0.14/0.46 % Removed by relevancy pruning/SinE : 26
% 0.14/0.46 % Initial clauses : 88
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 88
% 0.14/0.46 % Processed clauses : 655
% 0.14/0.46 % ...of these trivial : 9
% 0.14/0.46 % ...subsumed : 278
% 0.14/0.46 % ...remaining for further processing : 368
% 0.14/0.46 % Other redundant clauses eliminated : 1
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 0
% 0.14/0.46 % Backward-rewritten : 6
% 0.14/0.46 % Generated clauses : 1577
% 0.14/0.46 % ...of the previous two non-redundant : 1079
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 1574
% 0.14/0.46 % Factorizations : 2
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 1
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 944
% 0.14/0.46 % ...of those cached : 821
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 361
% 0.14/0.46 % Positive orientable unit clauses : 163
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 110
% 0.14/0.46 % Non-unit-clauses : 88
% 0.14/0.46 % Current number of unprocessed clauses: 512
% 0.14/0.46 % ...number of literals in the above : 1256
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 6
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 451
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 289
% 0.14/0.46 % Non-unit clause-clause subsumptions : 24
% 0.14/0.46 % Unit Clause-clause subsumption calls : 771
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 8
% 0.14/0.46 % BW rewrite match successes : 1
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 16984
% 0.14/0.46 % Search garbage collected termcells : 982
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.028 s
% 0.14/0.46 % System time : 0.004 s
% 0.14/0.46 % Total time : 0.032 s
% 0.14/0.46 % Maximum resident set size: 4016 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.032 s
% 0.14/0.46 % System time : 0.008 s
% 0.14/0.46 % Total time : 0.040 s
% 0.14/0.46 % Maximum resident set size: 4864 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------