%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU284+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:24:34 PM UTC 2026
% Result : Theorem 169.03s 34.27s
% Output : CNFRefutation 169.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 41 ( 8 unt; 0 def)
% Number of atoms : 228 ( 131 equ)
% Maximal formula atoms : 104 ( 5 avg)
% Number of connectives : 266 ( 79 ~; 127 |; 52 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 74 ( 14 sgn 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s2_funct_1__e16_22__wellord2__1,lemma,
! [X1] :
( ( ! [X2] :
~ ( ! [X3] : X3 != singleton(X2)
& in(X2,X1) )
& ! [X2,X3,X4] :
( ( X4 = singleton(X2)
& X3 = singleton(X2)
& in(X2,X1) )
=> X3 = X4 ) )
=> ? [X2] :
( ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) )
& relation_dom(X2) = X1
& function(X2)
& relation(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s2_funct_1__e16_22__wellord2__1) ).
fof(s3_funct_1__e16_22__wellord2,conjecture,
! [X1] :
? [X2] :
( ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) )
& relation_dom(X2) = X1
& function(X2)
& relation(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s3_funct_1__e16_22__wellord2) ).
fof(c_0_2,lemma,
! [X1] :
( ( ! [X2] :
~ ( ! [X3] : X3 != singleton(X2)
& in(X2,X1) )
& ! [X2,X3,X4] :
( ( X4 = singleton(X2)
& X3 = singleton(X2)
& in(X2,X1) )
=> X3 = X4 ) )
=> ? [X2] :
( ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) )
& relation_dom(X2) = X1
& function(X2)
& relation(X2) ) ),
inference(fof_simplification,[status(thm)],[s2_funct_1__e16_22__wellord2__1]) ).
fof(c_0_3,lemma,
! [X47,X52,X54] :
( ( esk14_1(X47) != esk15_1(X47)
| X52 != singleton(esk16_1(X47))
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( esk14_1(X47) != esk15_1(X47)
| X52 != singleton(esk16_1(X47))
| relation_dom(esk17_1(X47)) = X47 )
& ( esk14_1(X47) != esk15_1(X47)
| X52 != singleton(esk16_1(X47))
| function(esk17_1(X47)) )
& ( esk14_1(X47) != esk15_1(X47)
| X52 != singleton(esk16_1(X47))
| relation(esk17_1(X47)) )
& ( esk14_1(X47) != esk15_1(X47)
| in(esk16_1(X47),X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( esk14_1(X47) != esk15_1(X47)
| in(esk16_1(X47),X47)
| relation_dom(esk17_1(X47)) = X47 )
& ( esk14_1(X47) != esk15_1(X47)
| in(esk16_1(X47),X47)
| function(esk17_1(X47)) )
& ( esk14_1(X47) != esk15_1(X47)
| in(esk16_1(X47),X47)
| relation(esk17_1(X47)) )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| relation_dom(esk17_1(X47)) = X47 )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| function(esk17_1(X47)) )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| relation(esk17_1(X47)) )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| relation_dom(esk17_1(X47)) = X47 )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| function(esk17_1(X47)) )
& ( esk15_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| relation(esk17_1(X47)) )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| relation_dom(esk17_1(X47)) = X47 )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| function(esk17_1(X47)) )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| X52 != singleton(esk16_1(X47))
| relation(esk17_1(X47)) )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| relation_dom(esk17_1(X47)) = X47 )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| function(esk17_1(X47)) )
& ( esk14_1(X47) = singleton(esk13_1(X47))
| in(esk16_1(X47),X47)
| relation(esk17_1(X47)) )
& ( in(esk13_1(X47),X47)
| X52 != singleton(esk16_1(X47))
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( in(esk13_1(X47),X47)
| X52 != singleton(esk16_1(X47))
| relation_dom(esk17_1(X47)) = X47 )
& ( in(esk13_1(X47),X47)
| X52 != singleton(esk16_1(X47))
| function(esk17_1(X47)) )
& ( in(esk13_1(X47),X47)
| X52 != singleton(esk16_1(X47))
| relation(esk17_1(X47)) )
& ( in(esk13_1(X47),X47)
| in(esk16_1(X47),X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| ~ in(X54,X47) )
& ( in(esk13_1(X47),X47)
| in(esk16_1(X47),X47)
| relation_dom(esk17_1(X47)) = X47 )
& ( in(esk13_1(X47),X47)
| in(esk16_1(X47),X47)
| function(esk17_1(X47)) )
& ( in(esk13_1(X47),X47)
| in(esk16_1(X47),X47)
| relation(esk17_1(X47)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
? [X2] :
( ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) )
& relation_dom(X2) = X1
& function(X2)
& relation(X2) ),
inference(assume_negation,[status(cth)],[s3_funct_1__e16_22__wellord2]) ).
cnf(c_0_5,lemma,
( esk14_1(X1) != esk15_1(X1)
| X2 != singleton(esk16_1(X1))
| relation_dom(esk17_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,lemma,
( X2 != singleton(esk16_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1))
| relation_dom(esk17_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,lemma,
( X2 != singleton(esk16_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1))
| relation_dom(esk17_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,lemma,
( esk14_1(X1) != esk15_1(X1)
| X2 != singleton(esk16_1(X1))
| relation(esk17_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,lemma,
( X2 != singleton(esk16_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1))
| relation(esk17_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,lemma,
( X2 != singleton(esk16_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1))
| relation(esk17_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,lemma,
( esk14_1(X1) != esk15_1(X1)
| X2 != singleton(esk16_1(X1))
| function(esk17_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,lemma,
( X2 != singleton(esk16_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1))
| function(esk17_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,lemma,
( X2 != singleton(esk16_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1))
| function(esk17_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_14,negated_conjecture,
! [X14] :
( ( relation_dom(X14) != esk1_0
| ~ function(X14)
| ~ relation(X14)
| apply(X14,esk2_1(X14)) != singleton(esk2_1(X14)) )
& ( relation_dom(X14) != esk1_0
| ~ function(X14)
| ~ relation(X14)
| in(esk2_1(X14),esk1_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_15,lemma,
( esk15_1(X1) != esk14_1(X1)
| relation_dom(esk17_1(X1)) = X1 ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_16,lemma,
( relation_dom(esk17_1(X1)) = X1
| esk15_1(X1) = singleton(esk13_1(X1)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_17,lemma,
( relation_dom(esk17_1(X1)) = X1
| esk14_1(X1) = singleton(esk13_1(X1)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_18,lemma,
( esk15_1(X1) != esk14_1(X1)
| relation(esk17_1(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_19,lemma,
( relation(esk17_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_20,lemma,
( relation(esk17_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_21,lemma,
( esk15_1(X1) != esk14_1(X1)
| function(esk17_1(X1)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_22,lemma,
( function(esk17_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_23,lemma,
( function(esk17_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_24,lemma,
( X3 != singleton(esk16_1(X2))
| ~ in(X1,X2)
| esk15_1(X2) = singleton(esk13_1(X2))
| apply(esk17_1(X2),X1) = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,negated_conjecture,
( relation_dom(X1) != esk1_0
| ~ function(X1)
| ~ relation(X1)
| in(esk2_1(X1),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,lemma,
relation_dom(esk17_1(X1)) = X1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_27,lemma,
relation(esk17_1(X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_28,lemma,
function(esk17_1(X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( relation_dom(X1) != esk1_0
| ~ function(X1)
| ~ relation(X1)
| apply(X1,esk2_1(X1)) != singleton(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,lemma,
( X3 != singleton(esk16_1(X2))
| ~ in(X1,X2)
| esk14_1(X2) = singleton(esk13_1(X2))
| apply(esk17_1(X2),X1) = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_31,lemma,
( esk14_1(X2) != esk15_1(X2)
| X3 != singleton(esk16_1(X2))
| ~ in(X1,X2)
| apply(esk17_1(X2),X1) = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_32,lemma,
( ~ in(X2,X1)
| esk15_1(X1) = singleton(esk13_1(X1))
| apply(esk17_1(X1),X2) = singleton(X2) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
in(esk2_1(esk17_1(esk1_0)),esk1_0),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])])]) ).
cnf(c_0_34,negated_conjecture,
apply(esk17_1(esk1_0),esk2_1(esk17_1(esk1_0))) != singleton(esk2_1(esk17_1(esk1_0))),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_27]),c_0_28])])]) ).
cnf(c_0_35,lemma,
( ~ in(X2,X1)
| esk14_1(X1) = singleton(esk13_1(X1))
| apply(esk17_1(X1),X2) = singleton(X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_36,lemma,
( ~ in(X2,X1)
| esk15_1(X1) != esk14_1(X1)
| apply(esk17_1(X1),X2) = singleton(X2) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
esk15_1(esk1_0) = singleton(esk13_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
esk14_1(esk1_0) = singleton(esk13_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_34]) ).
cnf(c_0_39,lemma,
( ~ in(X1,esk1_0)
| apply(esk17_1(esk1_0),X1) = singleton(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU284+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.44 % Computer : n006.cluster.edu
% 0.18/5.44 % Model : x86_64 x86_64
% 0.18/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44 % Memory : 8046.5625MB
% 0.18/5.44 % OS : Linux 6.8.0-71-generic
% 0.18/5.44 % CPULimit : 300
% 0.18/5.44 % WCLimit : 300
% 0.18/5.44 % DateTime : Mon Sep 21 06:07:19 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.52 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
% 169.03/34.27 % Version: 3.5.1
% 169.03/34.27 % Preprocessing class: FSLSSMSSSSSNFFN.
% 169.03/34.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 169.03/34.27 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 169.03/34.27 % Starting new_bool_3 with 300s (1) cores
% 169.03/34.27 % Starting new_bool_1 with 300s (1) cores
% 169.03/34.27 % Starting sh5l with 300s (1) cores
% 169.03/34.27 % new_bool_3 with pid 2155658 completed with status 0
% 169.03/34.27 % Result found by new_bool_3
% 169.03/34.27 % Preprocessing class: FSLSSMSSSSSNFFN.
% 169.03/34.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 169.03/34.27 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 169.03/34.27 % Starting new_bool_3 with 300s (1) cores
% 169.03/34.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 169.03/34.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 169.03/34.27 % Search class: FGHSM-FSLM32-MFFFFFNN
% 169.03/34.27 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 169.03/34.27 % Starting SubtermCWHack with 28s (1) cores
% 169.03/34.27 % SubtermCWHack with pid 2155661 completed with status 8
% 169.03/34.27 % Starting new_bool_3 with 31s (1) cores
% 169.03/34.27 % new_bool_3 with pid 2155672 completed with status 0
% 169.03/34.27 % Result found by new_bool_3
% 169.03/34.27 % Preprocessing class: FSLSSMSSSSSNFFN.
% 169.03/34.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 169.03/34.27 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 169.03/34.27 % Starting new_bool_3 with 300s (1) cores
% 169.03/34.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 169.03/34.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 169.03/34.27 % Search class: FGHSM-FSLM32-MFFFFFNN
% 169.03/34.27 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 169.03/34.27 % Starting SubtermCWHack with 28s (1) cores
% 169.03/34.27 % SubtermCWHack with pid 2155661 completed with status 8
% 169.03/34.27 % Starting new_bool_3 with 31s (1) cores
% 169.03/34.27 % Preprocessing time : 0.008 s
% 169.03/34.27 % Presaturation interreduction done
% 169.03/34.27
% 169.03/34.27 % Proof found!
% 169.03/34.27 % SZS status Theorem
% 169.03/34.27 % SZS output start CNFRefutation
% See solution above
% 169.03/34.27 % Parsed axioms : 371
% 169.03/34.27 % Removed by relevancy pruning/SinE : 224
% 169.03/34.27 % Initial clauses : 441
% 169.03/34.27 % Removed in clause preprocessing : 2
% 169.03/34.27 % Initial clauses in saturation : 439
% 169.03/34.27 % Processed clauses : 2597
% 169.03/34.27 % ...of these trivial : 33
% 169.03/34.27 % ...subsumed : 1382
% 169.03/34.27 % ...remaining for further processing : 1182
% 169.03/34.27 % Other redundant clauses eliminated : 213
% 169.03/34.27 % Clauses deleted for lack of memory : 0
% 169.03/34.27 % Backward-subsumed : 12
% 169.03/34.27 % Backward-rewritten : 38
% 169.03/34.27 % Generated clauses : 8040
% 169.03/34.27 % ...of the previous two non-redundant : 6947
% 169.03/34.27 % ...aggressively subsumed : 0
% 169.03/34.27 % Contextual simplify-reflections : 31
% 169.03/34.27 % Paramodulations : 7852
% 169.03/34.27 % Factorizations : 2
% 169.03/34.27 % NegExts : 0
% 169.03/34.27 % Equation resolutions : 215
% 169.03/34.27 % Disequality decompositions : 0
% 169.03/34.27 % Total rewrite steps : 1703
% 169.03/34.27 % ...of those cached : 1419
% 169.03/34.27 % Propositional unsat checks : 0
% 169.03/34.27 % Propositional check models : 0
% 169.03/34.27 % Propositional check unsatisfiable : 0
% 169.03/34.27 % Propositional clauses : 0
% 169.03/34.27 % Propositional clauses after purity: 0
% 169.03/34.27 % Propositional unsat core size : 0
% 169.03/34.27 % Propositional preprocessing time : 0.000
% 169.03/34.27 % Propositional encoding time : 0.000
% 169.03/34.27 % Propositional solver time : 0.000
% 169.03/34.27 % Success case prop preproc time : 0.000
% 169.03/34.27 % Success case prop encoding time : 0.000
% 169.03/34.27 % Success case prop solver time : 0.000
% 169.03/34.27 % Current number of processed clauses : 663
% 169.03/34.27 % Positive orientable unit clauses : 119
% 169.03/34.27 % Positive unorientable unit clauses: 1
% 169.03/34.27 % Negative unit clauses : 117
% 169.03/34.27 % Non-unit-clauses : 426
% 169.03/34.27 % Current number of unprocessed clauses: 5127
% 169.03/34.27 % ...number of literals in the above : 16498
% 169.03/34.27 % Current number of archived formulas : 0
% 169.03/34.27 % Current number of archived clauses : 432
% 169.03/34.27 % Clause-clause subsumption calls (NU) : 78436
% 169.03/34.27 % Rec. Clause-clause subsumption calls : 37916
% 169.03/34.27 % Non-unit clause-clause subsumptions : 495
% 169.03/34.27 % Unit Clause-clause subsumption calls : 6502
% 169.03/34.27 % Rewrite failures with RHS unbound : 0
% 169.03/34.27 % BW rewrite match attempts : 71
% 169.03/34.27 % BW rewrite match successes : 32
% 169.03/34.27 % Condensation attempts : 0
% 169.03/34.27 % Condensation successes : 0
% 169.03/34.27 % Termbank termtop insertions : 117987
% 169.03/34.27 % Search garbage collected termcells : 7847
% 169.03/34.27
% 169.03/34.27 % -------------------------------------------------
% 169.03/34.27 % User time : 27.456 s
% 169.03/34.27 % System time : 0.954 s
% 169.03/34.27 % Total time : 28.410 s
% 169.03/34.27 % Maximum resident set size: 5092 pages
% 169.03/34.27
% 169.03/34.27 % -------------------------------------------------
% 169.03/34.27 % User time : 27.476 s
% 169.03/34.27 % System time : 0.961 s
% 169.03/34.27 % Total time : 28.437 s
% 169.03/34.27 % Maximum resident set size: 5120 pages
% 169.03/34.27 % E exiting
%------------------------------------------------------------------------------