%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET973+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:52 PM UTC 2026
% Result : Theorem 15.84s 3.58s
% Output : CNFRefutation 15.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 63 ( 36 unt; 0 def)
% Number of atoms : 130 ( 58 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 109 ( 42 ~; 46 |; 14 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 168 ( 12 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(t54_xboole_1,axiom,
! [X1,X2,X3] : set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X2),set_difference(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t54_xboole_1) ).
fof(t126_zfmisc_1,conjecture,
! [X1,X2,X3,X4] : set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t126_zfmisc_1) ).
fof(t125_zfmisc_1,axiom,
! [X1,X2,X3] :
( cartesian_product2(X3,set_difference(X1,X2)) = set_difference(cartesian_product2(X3,X1),cartesian_product2(X3,X2))
& cartesian_product2(set_difference(X1,X2),X3) = set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t125_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(t123_zfmisc_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_10,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_11,plain,
! [X49,X50,X51,X52,X53,X54,X55,X56] :
( ( X56 = set_difference(X54,X55)
| in(esk8_3(X54,X55,X56),X56)
| ~ in(esk8_3(X54,X55,X56),X55) )
& ( X56 = set_difference(X54,X55)
| in(esk8_3(X54,X55,X56),X56)
| in(esk8_3(X54,X55,X56),X54) )
& ( X56 = set_difference(X54,X55)
| in(esk8_3(X54,X55,X56),X55)
| ~ in(esk8_3(X54,X55,X56),X54)
| ~ in(esk8_3(X54,X55,X56),X56) )
& ( X51 != set_difference(X49,X50)
| in(X53,X51)
| in(X53,X50)
| ~ in(X53,X49) )
& ( X51 != set_difference(X49,X50)
| ~ in(X52,X51)
| ~ in(X52,X50) )
& ( X51 != set_difference(X49,X50)
| ~ in(X52,X51)
| in(X52,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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])]) ).
cnf(c_0_12,plain,
( X3 != set_difference(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X43,X44,X45,X46,X47] :
( ( subset(X46,X47)
| ~ in(esk7_2(X46,X47),X47) )
& ( subset(X46,X47)
| in(esk7_2(X46,X47),X46) )
& ( in(X45,X44)
| ~ in(X45,X43)
| ~ subset(X43,X44) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_14,plain,
( ~ in(X1,set_difference(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( X3 != set_difference(X4,X2)
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X15,X16] :
( ( X15 = X16
| ~ subset(X16,X15)
| ~ subset(X15,X16) )
& ( X15 != X16
| subset(X16,X15) )
& ( X15 != X16
| subset(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_18,plain,
( ~ in(esk7_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( in(esk7_2(set_difference(X1,X2),X3),X1)
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ in(X1,X3)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( X3 = set_difference(X1,X2)
| in(esk8_3(X1,X2,X3),X3)
| in(esk8_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ in(esk7_2(set_difference(X1,X2),X3),set_difference(X4,X1))
| subset(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,plain,
( in(esk8_3(X1,X2,X1),X1)
| set_difference(X1,X2) = X1 ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ subset(X1,set_difference(X1,X2))
| set_difference(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
subset(set_difference(X1,X1),X2),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
fof(c_0_28,plain,
! [X90,X91] : subset(set_intersection2(X90,X91),X90),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_29,plain,
( ~ in(esk8_3(X1,X2,X1),set_difference(X3,X1))
| set_difference(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_30,plain,
set_difference(set_difference(X1,X1),X2) = set_difference(X1,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ in(esk8_3(X1,X2,X3),X1)
| ~ in(esk8_3(X1,X2,X3),X3)
| X3 = set_difference(X1,X2)
| in(esk8_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X95,X96,X97] : set_difference(X95,set_intersection2(X96,X97)) = set_union2(set_difference(X95,X96),set_difference(X95,X97)),
inference(variable_rename,[status(thm)],[t54_xboole_1]) ).
cnf(c_0_34,plain,
( ~ in(esk8_3(X1,X2,X1),set_difference(X3,X3))
| set_difference(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( in(esk8_3(X1,X2,X1),X2)
| set_difference(X1,X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_25]) ).
cnf(c_0_36,plain,
( ~ subset(X1,set_intersection2(X1,X2))
| set_intersection2(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_37,plain,
set_difference(X1,set_intersection2(X2,X3)) = set_union2(set_difference(X1,X2),set_difference(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
set_difference(X1,set_difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
set_intersection2(set_difference(X1,X1),X2) = set_difference(X1,X1),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_40,plain,
( ~ subset(X1,set_difference(X2,X2))
| X1 = set_difference(X2,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_27]) ).
fof(c_0_41,negated_conjecture,
~ ! [X1,X2,X3,X4] : set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_union2(cartesian_product2(set_difference(X1,X3),X2),cartesian_product2(X1,set_difference(X2,X4))),
inference(assume_negation,[status(cth)],[t126_zfmisc_1]) ).
fof(c_0_42,plain,
! [X83,X84,X85] :
( cartesian_product2(X85,set_difference(X83,X84)) = set_difference(cartesian_product2(X85,X83),cartesian_product2(X85,X84))
& cartesian_product2(set_difference(X83,X84),X85) = set_difference(cartesian_product2(X83,X85),cartesian_product2(X84,X85)) ),
inference(variable_rename,[status(thm)],[t125_zfmisc_1]) ).
fof(c_0_43,plain,
! [X11,X12] : set_union2(X11,X12) = set_union2(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_44,plain,
set_union2(X1,set_difference(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_38]) ).
cnf(c_0_45,plain,
set_difference(X1,X1) = set_difference(X2,X2),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
fof(c_0_46,negated_conjecture,
set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)) != set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])]) ).
cnf(c_0_47,plain,
cartesian_product2(set_difference(X1,X2),X3) = set_difference(cartesian_product2(X1,X3),cartesian_product2(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_48,plain,
! [X79,X80,X81,X82] : cartesian_product2(set_intersection2(X79,X80),set_intersection2(X81,X82)) = set_intersection2(cartesian_product2(X79,X81),cartesian_product2(X80,X82)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
fof(c_0_49,plain,
! [X13,X14] : set_intersection2(X13,X14) = set_intersection2(X14,X13),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_50,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
set_union2(X1,set_difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)) != set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0))),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
set_union2(set_difference(cartesian_product2(X1,X2),X3),cartesian_product2(set_difference(X1,X4),X2)) = set_difference(cartesian_product2(X1,X2),set_intersection2(X3,cartesian_product2(X4,X2))),
inference(spm,[status(thm)],[c_0_37,c_0_47]) ).
cnf(c_0_54,plain,
cartesian_product2(X1,set_difference(X2,X3)) = set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_55,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,plain,
set_union2(set_difference(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
set_union2(cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0)),cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0)) != set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)),
inference(rw,[status(thm)],[c_0_52,c_0_50]) ).
cnf(c_0_59,plain,
set_union2(cartesian_product2(X1,set_difference(X2,X3)),cartesian_product2(set_difference(X1,X4),X2)) = set_difference(cartesian_product2(X1,X2),set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X4,X2))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_55]) ).
cnf(c_0_61,plain,
set_difference(X1,set_intersection2(X1,X2)) = set_difference(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET973+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.65 % Computer : n010.cluster.edu
% 0.17/0.65 % Model : x86_64 x86_64
% 0.17/0.65 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.65 % Memory : 8046.5625MB
% 0.17/0.65 % OS : Linux 6.8.0-71-generic
% 0.17/0.65 % CPULimit : 300
% 0.17/0.65 % WCLimit : 300
% 0.17/0.65 % DateTime : Mon Sep 21 05:45:25 UTC 2026
% 0.17/0.65 % CPUTime :
% 0.17/0.65 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.72 Running first-order theorem proving
% 0.21/0.72 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
% 15.84/3.58 % Version: 3.5.1
% 15.84/3.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 15.84/3.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.84/3.58 % Starting new_bool_3 with 300s (1) cores
% 15.84/3.58 % Starting new_bool_1 with 300s (1) cores
% 15.84/3.58 % Starting sh5l with 300s (1) cores
% 15.84/3.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 145944 completed with status 0
% 15.84/3.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 15.84/3.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 15.84/3.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.84/3.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.84/3.58 % No SInE strategy applied
% 15.84/3.58 % Search class: FGHSM-FFMF32-MFFFFFNN
% 15.84/3.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.84/3.58 % Starting SubtermCWHack with 136s (1) cores
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S033I with 136s (1) cores
% 15.84/3.58 % Starting new_bool_3 with 136s (1) cores
% 15.84/3.58 % Starting new_bool_1 with 136s (1) cores
% 15.84/3.58 % new_bool_3 with pid 145951 completed with status 0
% 15.84/3.58 % Result found by new_bool_3
% 15.84/3.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 15.84/3.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 15.84/3.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.84/3.58 % No SInE strategy applied
% 15.84/3.58 % Search class: FGHSM-FFMF32-MFFFFFNN
% 15.84/3.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.84/3.58 % Starting SubtermCWHack with 136s (1) cores
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 15.84/3.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S033I with 136s (1) cores
% 15.84/3.58 % Starting new_bool_3 with 136s (1) cores
% 15.84/3.58 % Preprocessing time : 0.003 s
% 15.84/3.58 % Presaturation interreduction done
% 15.84/3.58
% 15.84/3.58 % Proof found!
% 15.84/3.58 % SZS status Theorem
% 15.84/3.58 % SZS output start CNFRefutation
% See solution above
% 15.84/3.58 % Parsed axioms : 26
% 15.84/3.58 % Removed by relevancy pruning/SinE : 0
% 15.84/3.58 % Initial clauses : 50
% 15.84/3.58 % Removed in clause preprocessing : 1
% 15.84/3.58 % Initial clauses in saturation : 49
% 15.84/3.58 % Processed clauses : 4879
% 15.84/3.58 % ...of these trivial : 221
% 15.84/3.58 % ...subsumed : 3879
% 15.84/3.58 % ...remaining for further processing : 779
% 15.84/3.58 % Other redundant clauses eliminated : 13
% 15.84/3.58 % Clauses deleted for lack of memory : 0
% 15.84/3.58 % Backward-subsumed : 25
% 15.84/3.58 % Backward-rewritten : 34
% 15.84/3.58 % Generated clauses : 101398
% 15.84/3.58 % ...of the previous two non-redundant : 91659
% 15.84/3.58 % ...aggressively subsumed : 0
% 15.84/3.58 % Contextual simplify-reflections : 1
% 15.84/3.58 % Paramodulations : 100992
% 15.84/3.58 % Factorizations : 394
% 15.84/3.58 % NegExts : 0
% 15.84/3.58 % Equation resolutions : 13
% 15.84/3.58 % Disequality decompositions : 0
% 15.84/3.58 % Total rewrite steps : 30696
% 15.84/3.58 % ...of those cached : 25395
% 15.84/3.58 % Propositional unsat checks : 0
% 15.84/3.58 % Propositional check models : 0
% 15.84/3.58 % Propositional check unsatisfiable : 0
% 15.84/3.58 % Propositional clauses : 0
% 15.84/3.58 % Propositional clauses after purity: 0
% 15.84/3.58 % Propositional unsat core size : 0
% 15.84/3.58 % Propositional preprocessing time : 0.000
% 15.84/3.58 % Propositional encoding time : 0.000
% 15.84/3.58 % Propositional solver time : 0.000
% 15.84/3.58 % Success case prop preproc time : 0.000
% 15.84/3.58 % Success case prop encoding time : 0.000
% 15.84/3.58 % Success case prop solver time : 0.000
% 15.84/3.58 % Current number of processed clauses : 662
% 15.84/3.58 % Positive orientable unit clauses : 133
% 15.84/3.58 % Positive unorientable unit clauses: 46
% 15.84/3.58 % Negative unit clauses : 5
% 15.84/3.58 % Non-unit-clauses : 478
% 15.84/3.58 % Current number of unprocessed clauses: 86618
% 15.84/3.58 % ...number of literals in the above : 243935
% 15.84/3.58 % Current number of archived formulas : 0
% 15.84/3.58 % Current number of archived clauses : 106
% 15.84/3.58 % Clause-clause subsumption calls (NU) : 51056
% 15.84/3.58 % Rec. Clause-clause subsumption calls : 33519
% 15.84/3.58 % Non-unit clause-clause subsumptions : 2443
% 15.84/3.58 % Unit Clause-clause subsumption calls : 2399
% 15.84/3.58 % Rewrite failures with RHS unbound : 2284
% 15.84/3.58 % BW rewrite match attempts : 3448
% 15.84/3.58 % BW rewrite match successes : 387
% 15.84/3.58 % Condensation attempts : 0
% 15.84/3.58 % Condensation successes : 0
% 15.84/3.58 % Termbank termtop insertions : 1641734
% 15.84/3.58 % Search garbage collected termcells : 806
% 15.84/3.58
% 15.84/3.58 % -------------------------------------------------
% 15.84/3.58 % User time : 2.603 s
% 15.84/3.58 % System time : 0.118 s
% 15.84/3.58 % Total time : 2.721 s
% 15.84/3.58 % Maximum resident set size: 3644 pages
% 15.84/3.58
% 15.84/3.58 % -------------------------------------------------
% 15.84/3.58 % User time : 12.729 s
% 15.84/3.58 % System time : 0.570 s
% 15.84/3.58 % Total time : 13.299 s
% 15.84/3.58 % Maximum resident set size: 4608 pages
% 15.84/3.58 % E exiting
%------------------------------------------------------------------------------