%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET656+3 : 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 : 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 02:14:54 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 8 unt; 0 def)
% Number of atoms : 193 ( 11 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 237 ( 92 ~; 93 |; 18 &)
% ( 5 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 91 ( 2 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p21,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ilf_type(X2,set_type)
& ~ empty(X2) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21) ).
fof(p20,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ( ilf_type(power_set(X1),set_type)
& ~ empty(power_set(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p20) ).
fof(p30,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p30) ).
fof(p13,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ilf_type(X2,subset_type(X1))
<=> ilf_type(X2,member_type(power_set(X1))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p13) ).
fof(p6,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( ! [X4] :
( ilf_type(X4,relation_type(X1,X2))
=> ilf_type(X4,subset_type(cross_product(X1,X2))) )
& ! [X3] :
( ilf_type(X3,subset_type(cross_product(X1,X2)))
=> ilf_type(X3,relation_type(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6) ).
fof(prove_relset_1_18,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X1,X2))
=> intersection(X3,cross_product(X1,X2)) = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_18) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
=> intersection(X1,X2) = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).
fof(p17,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( subset(X1,X2)
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17) ).
fof(p19,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ( member(X1,power_set(X2))
<=> ! [X3] :
( ilf_type(X3,set_type)
=> ( member(X3,X1)
=> member(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p19) ).
fof(c_0_9,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ( ilf_type(X2,set_type)
& ~ empty(X2) )
=> ( ilf_type(X1,member_type(X2))
<=> member(X1,X2) ) ) ),
inference(fof_simplification,[status(thm)],[p21]) ).
fof(c_0_10,plain,
! [X1] :
( ilf_type(X1,set_type)
=> ( ilf_type(power_set(X1),set_type)
& ~ empty(power_set(X1)) ) ),
inference(fof_simplification,[status(thm)],[p20]) ).
fof(c_0_11,plain,
! [X58,X59] :
( ( ~ ilf_type(X58,set_type)
| ~ ilf_type(X59,set_type)
| empty(X59)
| ilf_type(X58,member_type(X59))
| ~ member(X58,X59) )
& ( ~ ilf_type(X58,set_type)
| ~ ilf_type(X59,set_type)
| empty(X59)
| member(X58,X59)
| ~ ilf_type(X58,member_type(X59)) ) ),
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_9])])])])]) ).
fof(c_0_12,plain,
! [X88] : ilf_type(X88,set_type),
inference(variable_rename,[status(thm)],[p30]) ).
fof(c_0_13,plain,
! [X41,X42] :
( ( ~ ilf_type(X41,set_type)
| ~ ilf_type(X42,set_type)
| ilf_type(X42,subset_type(X41))
| ~ ilf_type(X42,member_type(power_set(X41))) )
& ( ~ ilf_type(X41,set_type)
| ~ ilf_type(X42,set_type)
| ilf_type(X42,member_type(power_set(X41)))
| ~ ilf_type(X42,subset_type(X41)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p13])])])])]) ).
fof(c_0_14,plain,
! [X57] :
( ( ~ ilf_type(X57,set_type)
| ilf_type(power_set(X57),set_type) )
& ( ~ ilf_type(X57,set_type)
| ~ empty(power_set(X57)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_15,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,member_type(X2))
| empty(X2)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X1,subset_type(X2))
| ilf_type(X1,member_type(power_set(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ ilf_type(X1,set_type)
| ~ empty(power_set(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X22,X23,X24,X25] :
( ( ~ ilf_type(X22,set_type)
| ~ ilf_type(X23,set_type)
| ilf_type(X25,subset_type(cross_product(X22,X23)))
| ~ ilf_type(X25,relation_type(X22,X23)) )
& ( ~ ilf_type(X22,set_type)
| ~ ilf_type(X23,set_type)
| ilf_type(X24,relation_type(X22,X23))
| ~ ilf_type(X24,subset_type(cross_product(X22,X23))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p6])])])])]) ).
cnf(c_0_20,plain,
( ~ ilf_type(X2,member_type(X1))
| member(X2,X1)
| empty(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16])]) ).
cnf(c_0_21,plain,
( ~ ilf_type(X1,subset_type(X2))
| ilf_type(X1,member_type(power_set(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16]),c_0_16])]) ).
cnf(c_0_22,plain,
~ empty(power_set(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_16])]) ).
cnf(c_0_23,plain,
( ~ ilf_type(X2,set_type)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X1,relation_type(X2,X3))
| ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X1,X2))
=> intersection(X3,cross_product(X1,X2)) = X3 ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_18]) ).
fof(c_0_25,plain,
! [X6,X7] :
( intersection(X6,X7) = X6
| ~ subset(X6,X7)
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X6,set_type) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])]) ).
fof(c_0_26,plain,
! [X48,X49,X50] :
( ( ~ ilf_type(X48,set_type)
| ~ ilf_type(X49,set_type)
| subset(X48,X49)
| ~ member(esk8_2(X48,X49),X49) )
& ( ~ ilf_type(X48,set_type)
| ~ ilf_type(X49,set_type)
| subset(X48,X49)
| member(esk8_2(X48,X49),X48) )
& ( ~ ilf_type(X48,set_type)
| ~ ilf_type(X49,set_type)
| subset(X48,X49)
| ilf_type(esk8_2(X48,X49),set_type) )
& ( ~ ilf_type(X48,set_type)
| ~ ilf_type(X49,set_type)
| member(X50,X49)
| ~ member(X50,X48)
| ~ ilf_type(X50,set_type)
| ~ subset(X48,X49) ) ),
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)],[p17])])])])])]) ).
fof(c_0_27,plain,
! [X53,X54,X55] :
( ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X53,power_set(X54))
| ~ member(esk9_2(X53,X54),X54) )
& ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X53,power_set(X54))
| member(esk9_2(X53,X54),X53) )
& ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X53,power_set(X54))
| ilf_type(esk9_2(X53,X54),set_type) )
& ( ~ ilf_type(X53,set_type)
| ~ ilf_type(X54,set_type)
| member(X55,X54)
| ~ member(X55,X53)
| ~ ilf_type(X55,set_type)
| ~ member(X53,power_set(X54)) ) ),
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)],[p19])])])])])]) ).
cnf(c_0_28,plain,
( ~ ilf_type(X1,subset_type(X2))
| member(X1,power_set(X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_29,plain,
( ~ ilf_type(X1,relation_type(X2,X3))
| ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_16]),c_0_16])]) ).
fof(c_0_30,negated_conjecture,
( intersection(esk18_0,cross_product(esk16_0,esk17_0)) != esk18_0
& ilf_type(esk18_0,relation_type(esk16_0,esk17_0))
& ilf_type(esk17_0,set_type)
& ilf_type(esk16_0,set_type) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
cnf(c_0_31,plain,
( ~ subset(X1,X2)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| intersection(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(esk8_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| ~ member(X3,X1)
| ~ ilf_type(X3,set_type)
| ~ member(X1,power_set(X2))
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( ~ ilf_type(X1,relation_type(X2,X3))
| member(X1,power_set(cross_product(X2,X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
ilf_type(esk18_0,relation_type(esk16_0,esk17_0)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ subset(X1,X2)
| intersection(X1,X2) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_16]),c_0_16])]) ).
cnf(c_0_37,plain,
( ~ member(esk8_2(X1,X2),X2)
| subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_16]),c_0_16])]) ).
cnf(c_0_38,plain,
( ~ member(X1,X3)
| ~ member(X3,power_set(X2))
| member(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_16]),c_0_16]),c_0_16])]) ).
cnf(c_0_39,negated_conjecture,
member(esk18_0,power_set(cross_product(esk16_0,esk17_0))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type)
| subset(X1,X2)
| member(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_41,plain,
( ~ member(esk8_2(X1,X2),X2)
| intersection(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(X1,esk18_0)
| member(X1,cross_product(esk16_0,esk17_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( subset(X1,X2)
| member(esk8_2(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_16]),c_0_16])]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(esk8_2(X1,cross_product(esk16_0,esk17_0)),esk18_0)
| intersection(X1,cross_product(esk16_0,esk17_0)) = X1 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( member(esk8_2(X1,X2),X1)
| intersection(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
intersection(esk18_0,cross_product(esk16_0,esk17_0)) != esk18_0,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET656+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 05:30:36 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.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.10/0.42 % Version: 3.5.1
% 0.10/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.42 % Starting sh5l with 300s (1) cores
% 0.10/0.42 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 30309 completed with status 0
% 0.10/0.42 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.10/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.42 % No SInE strategy applied
% 0.10/0.42 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.42 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.10/0.42 % Starting new_bool_3 with 189s (1) cores
% 0.10/0.42 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.10/0.42 % 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 30317 completed with status 0
% 0.10/0.42 % Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.10/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.42 % No SInE strategy applied
% 0.10/0.42 % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.10/0.42 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S0Y with 209s (1) cores
% 0.10/0.42 % Starting new_bool_3 with 189s (1) cores
% 0.10/0.42 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.10/0.42 % Preprocessing time : 0.001 s
% 0.10/0.42 % Presaturation interreduction done
% 0.10/0.42
% 0.10/0.42 % Proof found!
% 0.10/0.42 % SZS status Theorem
% 0.10/0.42 % SZS output start CNFRefutation
% See solution above
% 0.10/0.42 % Parsed axioms : 31
% 0.10/0.42 % Removed by relevancy pruning/SinE : 0
% 0.10/0.42 % Initial clauses : 69
% 0.10/0.42 % Removed in clause preprocessing : 7
% 0.10/0.42 % Initial clauses in saturation : 62
% 0.10/0.42 % Processed clauses : 167
% 0.10/0.42 % ...of these trivial : 15
% 0.10/0.42 % ...subsumed : 23
% 0.10/0.42 % ...remaining for further processing : 129
% 0.10/0.42 % Other redundant clauses eliminated : 1
% 0.10/0.42 % Clauses deleted for lack of memory : 0
% 0.10/0.42 % Backward-subsumed : 0
% 0.10/0.42 % Backward-rewritten : 2
% 0.10/0.42 % Generated clauses : 156
% 0.10/0.42 % ...of the previous two non-redundant : 130
% 0.10/0.42 % ...aggressively subsumed : 0
% 0.10/0.42 % Contextual simplify-reflections : 1
% 0.10/0.42 % Paramodulations : 153
% 0.10/0.42 % Factorizations : 2
% 0.10/0.42 % NegExts : 0
% 0.10/0.42 % Equation resolutions : 1
% 0.10/0.42 % Disequality decompositions : 0
% 0.10/0.42 % Total rewrite steps : 132
% 0.10/0.42 % ...of those cached : 103
% 0.10/0.42 % Propositional unsat checks : 0
% 0.10/0.42 % Propositional check models : 0
% 0.10/0.42 % Propositional check unsatisfiable : 0
% 0.10/0.42 % Propositional clauses : 0
% 0.10/0.42 % Propositional clauses after purity: 0
% 0.10/0.42 % Propositional unsat core size : 0
% 0.10/0.42 % Propositional preprocessing time : 0.000
% 0.10/0.42 % Propositional encoding time : 0.000
% 0.10/0.42 % Propositional solver time : 0.000
% 0.10/0.42 % Success case prop preproc time : 0.000
% 0.10/0.42 % Success case prop encoding time : 0.000
% 0.10/0.42 % Success case prop solver time : 0.000
% 0.10/0.42 % Current number of processed clauses : 81
% 0.10/0.42 % Positive orientable unit clauses : 20
% 0.10/0.42 % Positive unorientable unit clauses: 1
% 0.10/0.42 % Negative unit clauses : 2
% 0.10/0.42 % Non-unit-clauses : 58
% 0.10/0.42 % Current number of unprocessed clauses: 70
% 0.10/0.42 % ...number of literals in the above : 192
% 0.10/0.42 % Current number of archived formulas : 0
% 0.10/0.42 % Current number of archived clauses : 47
% 0.10/0.42 % Clause-clause subsumption calls (NU) : 923
% 0.10/0.42 % Rec. Clause-clause subsumption calls : 658
% 0.10/0.42 % Non-unit clause-clause subsumptions : 18
% 0.10/0.42 % Unit Clause-clause subsumption calls : 180
% 0.10/0.42 % Rewrite failures with RHS unbound : 0
% 0.10/0.42 % BW rewrite match attempts : 21
% 0.10/0.42 % BW rewrite match successes : 12
% 0.10/0.42 % Condensation attempts : 0
% 0.10/0.42 % Condensation successes : 0
% 0.10/0.42 % Termbank termtop insertions : 8647
% 0.10/0.42 % Search garbage collected termcells : 1590
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.008 s
% 0.10/0.42 % System time : 0.004 s
% 0.10/0.42 % Total time : 0.012 s
% 0.10/0.42 % Maximum resident set size: 3928 pages
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.036 s
% 0.10/0.42 % System time : 0.016 s
% 0.10/0.42 % Total time : 0.052 s
% 0.10/0.42 % Maximum resident set size: 4608 pages
% 0.10/0.42 % E exiting
%------------------------------------------------------------------------------