%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET774+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:15:11 PM UTC 2026
% Result : Theorem 0.14s 5.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 46 ( 5 unt; 0 def)
% Number of atoms : 198 ( 0 equ)
% Maximal formula atoms : 46 ( 4 avg)
% Number of connectives : 228 ( 76 ~; 121 |; 23 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thIII10,conjecture,
! [X4,X3,X7] :
( ( subset(X3,X4)
& pre_order(X7,X4) )
=> pre_order(X7,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIII10) ).
fof(pre_order,axiom,
! [X7,X4] :
( pre_order(X7,X4)
<=> ( ! [X3,X5,X6] :
( ( member(X6,X4)
& member(X5,X4)
& member(X3,X4) )
=> ( ( apply(X7,X5,X6)
& apply(X7,X3,X5) )
=> apply(X7,X3,X6) ) )
& ! [X3] :
( member(X3,X4)
=> apply(X7,X3,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+2.ax',pre_order) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(c_0_3,negated_conjecture,
~ ! [X4,X3,X7] :
( ( subset(X3,X4)
& pre_order(X7,X4) )
=> pre_order(X7,X3) ),
inference(assume_negation,[status(cth)],[thIII10]) ).
fof(c_0_4,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18] :
( ( pre_order(X17,X18)
| ~ apply(X17,esk4_2(X17,X18),esk4_2(X17,X18))
| ~ apply(X17,esk5_2(X17,X18),esk7_2(X17,X18)) )
& ( pre_order(X17,X18)
| ~ apply(X17,esk4_2(X17,X18),esk4_2(X17,X18))
| apply(X17,esk6_2(X17,X18),esk7_2(X17,X18)) )
& ( pre_order(X17,X18)
| ~ apply(X17,esk4_2(X17,X18),esk4_2(X17,X18))
| apply(X17,esk5_2(X17,X18),esk6_2(X17,X18)) )
& ( pre_order(X17,X18)
| ~ apply(X17,esk4_2(X17,X18),esk4_2(X17,X18))
| member(esk7_2(X17,X18),X18) )
& ( pre_order(X17,X18)
| ~ apply(X17,esk4_2(X17,X18),esk4_2(X17,X18))
| member(esk6_2(X17,X18),X18) )
& ( pre_order(X17,X18)
| ~ apply(X17,esk4_2(X17,X18),esk4_2(X17,X18))
| member(esk5_2(X17,X18),X18) )
& ( pre_order(X17,X18)
| member(esk4_2(X17,X18),X18)
| ~ apply(X17,esk5_2(X17,X18),esk7_2(X17,X18)) )
& ( pre_order(X17,X18)
| member(esk4_2(X17,X18),X18)
| apply(X17,esk6_2(X17,X18),esk7_2(X17,X18)) )
& ( pre_order(X17,X18)
| member(esk4_2(X17,X18),X18)
| apply(X17,esk5_2(X17,X18),esk6_2(X17,X18)) )
& ( pre_order(X17,X18)
| member(esk4_2(X17,X18),X18)
| member(esk7_2(X17,X18),X18) )
& ( pre_order(X17,X18)
| member(esk4_2(X17,X18),X18)
| member(esk6_2(X17,X18),X18) )
& ( pre_order(X17,X18)
| member(esk4_2(X17,X18),X18)
| member(esk5_2(X17,X18),X18) )
& ( ~ pre_order(X11,X12)
| apply(X11,X14,X16)
| ~ apply(X11,X15,X16)
| ~ apply(X11,X14,X15)
| ~ member(X16,X12)
| ~ member(X15,X12)
| ~ member(X14,X12) )
& ( ~ pre_order(X11,X12)
| apply(X11,X13,X13)
| ~ member(X13,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[pre_order])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( ~ pre_order(esk3_0,esk2_0)
& subset(esk2_0,esk1_0)
& pre_order(esk3_0,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X23,X24,X25,X26,X27] :
( ( subset(X26,X27)
| ~ member(esk8_2(X26,X27),X27) )
& ( subset(X26,X27)
| member(esk8_2(X26,X27),X26) )
& ( member(X25,X24)
| ~ member(X25,X23)
| ~ subset(X23,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])])]) ).
cnf(c_0_7,plain,
( ~ pre_order(X3,X2)
| ~ member(X1,X2)
| apply(X3,X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
pre_order(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ pre_order(X5,X2)
| ~ apply(X5,X3,X4)
| ~ apply(X5,X1,X3)
| ~ member(X4,X2)
| ~ member(X3,X2)
| ~ member(X1,X2)
| apply(X5,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| pre_order(X1,X2)
| apply(X1,esk6_2(X1,X2),esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
subset(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| pre_order(X1,X2)
| member(esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(X1,esk1_0)
| apply(esk3_0,X1,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| pre_order(X1,X2)
| member(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( ~ member(X3,X4)
| ~ member(esk6_2(X1,X2),X4)
| ~ member(esk7_2(X1,X2),X4)
| ~ apply(X1,X3,esk6_2(X1,X2))
| ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| ~ pre_order(X1,X4)
| apply(X1,X3,esk7_2(X1,X2))
| pre_order(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(X1,esk2_0)
| member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(esk4_2(esk3_0,X1),esk1_0)
| member(esk7_2(esk3_0,X1),X1)
| pre_order(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ pre_order(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(esk4_2(esk3_0,X1),esk1_0)
| member(esk6_2(esk3_0,X1),X1)
| pre_order(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| pre_order(X1,X2)
| member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
( pre_order(X1,X2)
| member(esk4_2(X1,X2),X2)
| apply(X1,esk6_2(X1,X2),esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,plain,
( pre_order(X1,X2)
| member(esk4_2(X1,X2),X2)
| member(esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,plain,
( pre_order(X1,X2)
| member(esk4_2(X1,X2),X2)
| member(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X2,X3)
| ~ member(esk6_2(esk3_0,X1),X3)
| ~ member(esk7_2(esk3_0,X1),X3)
| ~ member(esk4_2(esk3_0,X1),esk1_0)
| ~ apply(esk3_0,X2,esk6_2(esk3_0,X1))
| ~ pre_order(esk3_0,X3)
| apply(esk3_0,X2,esk7_2(esk3_0,X1))
| pre_order(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(esk4_2(esk3_0,esk2_0),esk1_0)
| member(esk7_2(esk3_0,esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk4_2(esk3_0,esk2_0),esk1_0)
| member(esk6_2(esk3_0,esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(esk4_2(esk3_0,X1),esk1_0)
| member(esk5_2(esk3_0,X1),X1)
| pre_order(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_29,plain,
( ~ member(X3,X4)
| ~ member(esk6_2(X1,X2),X4)
| ~ member(esk7_2(X1,X2),X4)
| ~ apply(X1,X3,esk6_2(X1,X2))
| ~ pre_order(X1,X4)
| member(esk4_2(X1,X2),X2)
| apply(X1,X3,esk7_2(X1,X2))
| pre_order(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( member(esk7_2(X1,esk2_0),esk1_0)
| member(esk4_2(X1,esk2_0),esk2_0)
| pre_order(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( member(esk6_2(X1,esk2_0),esk1_0)
| member(esk4_2(X1,esk2_0),esk2_0)
| pre_order(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_32,plain,
( pre_order(X1,X2)
| member(esk4_2(X1,X2),X2)
| member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_33,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| ~ apply(X1,esk5_2(X1,X2),esk7_2(X1,X2))
| pre_order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,esk1_0)
| ~ member(esk4_2(esk3_0,esk2_0),esk1_0)
| ~ apply(esk3_0,X1,esk6_2(esk3_0,esk2_0))
| apply(esk3_0,X1,esk7_2(esk3_0,esk2_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_8])]),c_0_19]),c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(esk4_2(esk3_0,esk2_0),esk1_0)
| member(esk5_2(esk3_0,esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_19]) ).
cnf(c_0_36,plain,
( ~ apply(X1,esk5_2(X1,X2),esk7_2(X1,X2))
| pre_order(X1,X2)
| member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(X2,esk1_0)
| ~ apply(X1,X2,esk6_2(X1,esk2_0))
| ~ pre_order(X1,esk1_0)
| member(esk4_2(X1,esk2_0),esk2_0)
| apply(X1,X2,esk7_2(X1,esk2_0))
| pre_order(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( member(esk5_2(X1,esk2_0),esk1_0)
| member(esk4_2(X1,esk2_0),esk2_0)
| pre_order(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_39,plain,
( pre_order(X1,X2)
| member(esk4_2(X1,X2),X2)
| apply(X1,esk5_2(X1,X2),esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(esk4_2(esk3_0,esk2_0),esk1_0)
| ~ apply(esk3_0,esk5_2(esk3_0,esk2_0),esk6_2(esk3_0,esk2_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_19]),c_0_35]),c_0_14]) ).
cnf(c_0_41,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| pre_order(X1,X2)
| apply(X1,esk5_2(X1,X2),esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_42,negated_conjecture,
( ~ pre_order(X1,esk1_0)
| member(esk4_2(X1,esk2_0),esk2_0)
| pre_order(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ member(esk4_2(esk3_0,esk2_0),esk1_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_19]),c_0_14]) ).
cnf(c_0_44,negated_conjecture,
( ~ pre_order(X1,esk1_0)
| member(esk4_2(X1,esk2_0),esk1_0)
| pre_order(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_8])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET774+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/5.36 % Computer : n012.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Mon Sep 21 05:37:12 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.40 Running first-order theorem proving
% 0.14/5.40 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/5.43 % Version: 3.5.1
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.43 % Starting sh5l with 300s (1) cores
% 0.14/5.43 % new_bool_1 with pid 1656521 completed with status 0
% 0.14/5.43 % Result found by new_bool_1
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.43 % Search class: FGUNF-FFMF22-SFFFFFNN
% 0.14/5.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.43 % SubtermCWHack with pid 1656524 completed with status 0
% 0.14/5.43 % Result found by SubtermCWHack
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.43 % Search class: FGUNF-FFMF22-SFFFFFNN
% 0.14/5.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.43 % Preprocessing time : 0.001 s
% 0.14/5.43
% 0.14/5.43 % Proof found!
% 0.14/5.43 % SZS status Theorem
% 0.14/5.43 % SZS output start CNFRefutation
% See solution above
% 0.14/5.43 % Parsed axioms : 17
% 0.14/5.43 % Removed by relevancy pruning/SinE : 14
% 0.14/5.43 % Initial clauses : 20
% 0.14/5.43 % Removed in clause preprocessing : 0
% 0.14/5.43 % Initial clauses in saturation : 20
% 0.14/5.43 % Processed clauses : 50
% 0.14/5.43 % ...of these trivial : 0
% 0.14/5.43 % ...subsumed : 4
% 0.14/5.43 % ...remaining for further processing : 46
% 0.14/5.43 % Other redundant clauses eliminated : 0
% 0.14/5.43 % Clauses deleted for lack of memory : 0
% 0.14/5.43 % Backward-subsumed : 9
% 0.14/5.43 % Backward-rewritten : 0
% 0.14/5.43 % Generated clauses : 49
% 0.14/5.43 % ...of the previous two non-redundant : 38
% 0.14/5.43 % ...aggressively subsumed : 0
% 0.14/5.43 % Contextual simplify-reflections : 9
% 0.14/5.43 % Paramodulations : 49
% 0.14/5.43 % Factorizations : 0
% 0.14/5.43 % NegExts : 0
% 0.14/5.43 % Equation resolutions : 0
% 0.14/5.43 % Disequality decompositions : 0
% 0.14/5.43 % Total rewrite steps : 6
% 0.14/5.43 % ...of those cached : 4
% 0.14/5.43 % Propositional unsat checks : 0
% 0.14/5.43 % Propositional check models : 0
% 0.14/5.43 % Propositional check unsatisfiable : 0
% 0.14/5.43 % Propositional clauses : 0
% 0.14/5.43 % Propositional clauses after purity: 0
% 0.14/5.43 % Propositional unsat core size : 0
% 0.14/5.43 % Propositional preprocessing time : 0.000
% 0.14/5.43 % Propositional encoding time : 0.000
% 0.14/5.43 % Propositional solver time : 0.000
% 0.14/5.43 % Success case prop preproc time : 0.000
% 0.14/5.43 % Success case prop encoding time : 0.000
% 0.14/5.43 % Success case prop solver time : 0.000
% 0.14/5.43 % Current number of processed clauses : 37
% 0.14/5.43 % Positive orientable unit clauses : 3
% 0.14/5.43 % Positive unorientable unit clauses: 0
% 0.14/5.43 % Negative unit clauses : 2
% 0.14/5.43 % Non-unit-clauses : 32
% 0.14/5.43 % Current number of unprocessed clauses: 5
% 0.14/5.43 % ...number of literals in the above : 44
% 0.14/5.43 % Current number of archived formulas : 0
% 0.14/5.43 % Current number of archived clauses : 9
% 0.14/5.43 % Clause-clause subsumption calls (NU) : 415
% 0.14/5.43 % Rec. Clause-clause subsumption calls : 98
% 0.14/5.43 % Non-unit clause-clause subsumptions : 16
% 0.14/5.43 % Unit Clause-clause subsumption calls : 13
% 0.14/5.43 % Rewrite failures with RHS unbound : 0
% 0.14/5.43 % BW rewrite match attempts : 2
% 0.14/5.43 % BW rewrite match successes : 0
% 0.14/5.43 % Condensation attempts : 0
% 0.14/5.43 % Condensation successes : 0
% 0.14/5.43 % Termbank termtop insertions : 2885
% 0.14/5.43 % Search garbage collected termcells : 500
% 0.14/5.43
% 0.14/5.43 % -------------------------------------------------
% 0.14/5.43 % User time : 0.008 s
% 0.14/5.43 % System time : 0.001 s
% 0.14/5.43 % Total time : 0.009 s
% 0.14/5.43 % Maximum resident set size: 3664 pages
% 0.14/5.43
% 0.14/5.43 % -------------------------------------------------
% 0.14/5.43 % User time : 0.008 s
% 0.14/5.43 % System time : 0.006 s
% 0.14/5.43 % Total time : 0.014 s
% 0.14/5.43 % Maximum resident set size: 4608 pages
% 0.14/5.43 % E exiting
%------------------------------------------------------------------------------