%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU420+4 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:25:05 PM UTC 2026
% Result : Theorem 259.04s 41.00s
% Output : CNFRefutation 259.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 27 unt; 0 def)
% Number of atoms : 84 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 30 ~; 23 |; 4 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 77 ( 2 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_relset_2,conjecture,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_relset_2) ).
fof(d2_pua2mss1,axiom,
! [X1] : k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+441.ax',d2_pua2mss1) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X3)
& r1_tarski(X1,X2) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t157_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ( r1_tarski(X2,X3)
=> r1_tarski(k9_relat_1(X2,X1),k9_relat_1(X3,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t157_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).
fof(t2_boole,axiom,
! [X1] : k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t2_boole) ).
fof(t36_xboole_1,axiom,
! [X1,X2] : r1_tarski(k4_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t36_xboole_1) ).
fof(t49_xboole_1,axiom,
! [X1,X2,X3] : k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t49_xboole_1) ).
fof(t3_boole,axiom,
! [X1] : k4_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t3_boole) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,X2) = k1_xboole_0
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t37_xboole_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
inference(assume_negation,[status(cth)],[t13_relset_2]) ).
fof(c_0_12,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0))))
& v1_relat_1(esk3_0)
& v1_relat_1(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_13,plain,
! [X670] : k3_pua2mss1(X670) = k8_eqrel_1(X670,k6_partfun1(X670)),
inference(variable_rename,[status(thm)],[d2_pua2mss1]) ).
fof(c_0_14,plain,
! [X195,X196] : k4_xboole_0(X195,k4_xboole_0(X195,X196)) = k3_xboole_0(X195,X196),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_15,plain,
! [X155,X156,X157] :
( r1_tarski(X155,k3_xboole_0(X156,X157))
| ~ r1_tarski(X155,X157)
| ~ r1_tarski(X155,X156) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
cnf(c_0_16,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2)
| r1_tarski(X1,k3_xboole_0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X452,X453,X454] :
( r1_tarski(k9_relat_1(X453,X452),k9_relat_1(X454,X452))
| ~ r1_tarski(X453,X454)
| ~ v1_relat_1(X454)
| ~ v1_relat_1(X453) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t157_relat_1])])])]) ).
fof(c_0_21,plain,
! [X86,X87] :
( v1_relat_1(X86)
| ~ r1_tarski(X86,X87)
| ~ v1_relat_1(X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])])]) ).
cnf(c_0_22,negated_conjecture,
~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k4_xboole_0(k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k4_xboole_0(k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk3_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_23,plain,
( ~ r1_tarski(X1,X2)
| ~ r1_tarski(X1,X3)
| r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3))) ),
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,plain,
( ~ r1_tarski(X1,X2)
| ~ v1_relat_1(X2)
| ~ v1_relat_1(X1)
| r1_tarski(k9_relat_1(X1,X3),k9_relat_1(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( ~ r1_tarski(X2,X1)
| ~ v1_relat_1(X1)
| v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X146] : k3_xboole_0(X146,k1_xboole_0) = k1_xboole_0,
inference(variable_rename,[status(thm)],[t2_boole]) ).
cnf(c_0_27,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))))
| ~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk3_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ r1_tarski(X1,X3)
| ~ v1_relat_1(X3)
| r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X2)) ),
inference(csr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_30,plain,
! [X1306,X1307] : r1_tarski(k4_xboole_0(X1306,X1307),X1306),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_31,plain,
! [X197,X198,X199] : k3_xboole_0(X197,k4_xboole_0(X198,X199)) = k4_xboole_0(k3_xboole_0(X197,X198),X199),
inference(variable_rename,[status(thm)],[t49_xboole_1]) ).
cnf(c_0_32,plain,
k3_xboole_0(X1,k1_xboole_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_33,plain,
! [X1292] : k4_xboole_0(X1292,k1_xboole_0) = X1292,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_34,negated_conjecture,
( ~ r1_tarski(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),esk3_0)
| ~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k8_eqrel_1(esk1_0,k6_partfun1(esk1_0))),k9_relat_1(esk2_0,k8_eqrel_1(esk1_0,k6_partfun1(esk1_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X1308,X1309] :
( ( k4_xboole_0(X1308,X1309) = k1_xboole_0
| ~ r1_tarski(X1308,X1309) )
& ( r1_tarski(X1308,X1309)
| k4_xboole_0(X1308,X1309) != k1_xboole_0 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])]) ).
cnf(c_0_38,plain,
k3_xboole_0(X1,k4_xboole_0(X2,X3)) = k4_xboole_0(k3_xboole_0(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k1_xboole_0)) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_40,plain,
k4_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_35]),c_0_36])]) ).
cnf(c_0_42,plain,
( k4_xboole_0(X1,X2) != k1_xboole_0
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k4_xboole_0(X2,X3))) = k4_xboole_0(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_18]),c_0_18]) ).
cnf(c_0_44,plain,
k4_xboole_0(X1,X1) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
$false,
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_41,c_0_42]),c_0_43]),c_0_44]),c_0_40]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU420+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 06:25:17 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 259.04/41.00 % Version: 3.5.1
% 259.04/41.00 % Preprocessing class: FMLLMLLLSSSNFFN.
% 259.04/41.00 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 259.04/41.00 % Starting new_bool_3 with 894s (3) cores
% 259.04/41.00 % Starting new_bool_1 with 894s (3) cores
% 259.04/41.00 % Starting sh5l with 298s (1) cores
% 259.04/41.00 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 259.04/41.00 % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 2765593 completed with status 0
% 259.04/41.00 % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 259.04/41.00 % Preprocessing class: FMLLMLLLSSSNFFN.
% 259.04/41.00 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 259.04/41.00 % Starting new_bool_3 with 894s (3) cores
% 259.04/41.00 % Starting new_bool_1 with 894s (3) cores
% 259.04/41.00 % Starting sh5l with 298s (1) cores
% 259.04/41.00 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 259.04/41.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 259.04/41.00 % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 259.04/41.00 % Search class: FGHSM-SMLM32-DFFFFFNN
% 259.04/41.00 % Scheduled 12 strats onto 1 cores with 297 seconds (297 total)
% 259.04/41.00 % Starting SubtermCWHack with 30s (1) cores
% 259.04/41.00 % SubtermCWHack with pid 2765594 completed with status 8
% 259.04/41.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 25s (1) cores
% 259.04/41.00 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 2765615 completed with status 0
% 259.04/41.00 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 259.04/41.00 % Preprocessing class: FMLLMLLLSSSNFFN.
% 259.04/41.00 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 259.04/41.00 % Starting new_bool_3 with 894s (3) cores
% 259.04/41.00 % Starting new_bool_1 with 894s (3) cores
% 259.04/41.00 % Starting sh5l with 298s (1) cores
% 259.04/41.00 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 259.04/41.00 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 259.04/41.00 % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 259.04/41.00 % Search class: FGHSM-SMLM32-DFFFFFNN
% 259.04/41.00 % Scheduled 12 strats onto 1 cores with 297 seconds (297 total)
% 259.04/41.00 % Starting SubtermCWHack with 30s (1) cores
% 259.04/41.00 % SubtermCWHack with pid 2765594 completed with status 8
% 259.04/41.00 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 25s (1) cores
% 259.04/41.00 % Preprocessing time : 0.167 s
% 259.04/41.00 % Presaturation interreduction done
% 259.04/41.00
% 259.04/41.00 % Proof found!
% 259.04/41.00 % SZS status Theorem
% 259.04/41.00 % SZS output start CNFRefutation
% See solution above
% 259.04/41.00 % Parsed axioms : 71092
% 259.04/41.00 % Removed by relevancy pruning/SinE : 70091
% 259.04/41.00 % Initial clauses : 2051
% 259.04/41.00 % Removed in clause preprocessing : 45
% 259.04/41.00 % Initial clauses in saturation : 2006
% 259.04/41.00 % Processed clauses : 4039
% 259.04/41.00 % ...of these trivial : 34
% 259.04/41.00 % ...subsumed : 207
% 259.04/41.00 % ...remaining for further processing : 3798
% 259.04/41.00 % Other redundant clauses eliminated : 840
% 259.04/41.00 % Clauses deleted for lack of memory : 0
% 259.04/41.00 % Backward-subsumed : 7
% 259.04/41.00 % Backward-rewritten : 27
% 259.04/41.00 % Generated clauses : 79543
% 259.04/41.00 % ...of the previous two non-redundant : 75808
% 259.04/41.00 % ...aggressively subsumed : 0
% 259.04/41.00 % Contextual simplify-reflections : 108
% 259.04/41.00 % Paramodulations : 78650
% 259.04/41.00 % Factorizations : 29
% 259.04/41.00 % NegExts : 0
% 259.04/41.00 % Equation resolutions : 875
% 259.04/41.00 % Disequality decompositions : 0
% 259.04/41.00 % Total rewrite steps : 17731
% 259.04/41.00 % ...of those cached : 15681
% 259.04/41.00 % Propositional unsat checks : 0
% 259.04/41.00 % Propositional check models : 0
% 259.04/41.00 % Propositional check unsatisfiable : 0
% 259.04/41.00 % Propositional clauses : 0
% 259.04/41.00 % Propositional clauses after purity: 0
% 259.04/41.00 % Propositional unsat core size : 0
% 259.04/41.00 % Propositional preprocessing time : 0.000
% 259.04/41.00 % Propositional encoding time : 0.000
% 259.04/41.00 % Propositional solver time : 0.000
% 259.04/41.00 % Success case prop preproc time : 0.000
% 259.04/41.00 % Success case prop encoding time : 0.000
% 259.04/41.00 % Success case prop solver time : 0.000
% 259.04/41.00 % Current number of processed clauses : 1810
% 259.04/41.00 % Positive orientable unit clauses : 199
% 259.04/41.00 % Positive unorientable unit clauses: 5
% 259.04/41.00 % Negative unit clauses : 67
% 259.04/41.00 % Non-unit-clauses : 1539
% 259.04/41.00 % Current number of unprocessed clauses: 75542
% 259.04/41.00 % ...number of literals in the above : 439047
% 259.04/41.00 % Current number of archived formulas : 0
% 259.04/41.00 % Current number of archived clauses : 1818
% 259.04/41.00 % Clause-clause subsumption calls (NU) : 1681549
% 259.04/41.00 % Rec. Clause-clause subsumption calls : 189553
% 259.04/41.00 % Non-unit clause-clause subsumptions : 273
% 259.04/41.00 % Unit Clause-clause subsumption calls : 31372
% 259.04/41.00 % Rewrite failures with RHS unbound : 0
% 259.04/41.00 % BW rewrite match attempts : 240
% 259.04/41.00 % BW rewrite match successes : 107
% 259.04/41.00 % Condensation attempts : 0
% 259.04/41.00 % Condensation successes : 0
% 259.04/41.00 % Termbank termtop insertions : 4416144
% 259.04/41.00 % Search garbage collected termcells : 802534
% 259.04/41.00
% 259.04/41.00 % -------------------------------------------------
% 259.04/41.00 % User time : 36.179 s
% 259.04/41.00 % System time : 1.345 s
% 259.04/41.00 % Total time : 37.524 s
% 259.04/41.00 % Maximum resident set size: 148880 pages
% 259.04/41.00
% 259.04/41.00 % -------------------------------------------------
% 259.04/41.00 % User time : 38.175 s
% 259.04/41.00 % System time : 1.490 s
% 259.04/41.00 % Total time : 39.665 s
% 259.04/41.00 % Maximum resident set size: 121088 pages
% 259.04/41.00 % E exiting
%------------------------------------------------------------------------------