%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET720+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:04 PM UTC 2026
% Result : Theorem 8.69s 1.77s
% Output : CNFRefutation 8.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 155 ( 12 equ)
% Maximal formula atoms : 55 ( 5 avg)
% Number of connectives : 182 ( 57 ~; 80 |; 34 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 92 ( 0 sgn 52 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII11,conjecture,
! [X6,X1,X2] :
( ( one_to_one(X6,X1,X2)
& maps(X6,X1,X2) )
=> equal_maps(inverse_function(inverse_function(X6,X1,X2),X2,X1),X6,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII11) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X8,X2)
& member(X7,X2)
& member(X3,X1) )
=> ( ( apply(X10,X3,X8)
& apply(X6,X3,X7) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',equal_maps) ).
fof(maps,axiom,
! [X6,X1,X2] :
( maps(X6,X1,X2)
<=> ( ! [X3,X7,X8] :
( ( member(X8,X2)
& member(X7,X2)
& member(X3,X1) )
=> ( ( apply(X6,X3,X8)
& apply(X6,X3,X7) )
=> X7 = X8 ) )
& ! [X3] :
( member(X3,X1)
=> ? [X5] :
( apply(X6,X3,X5)
& member(X5,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',maps) ).
fof(inverse_function,axiom,
! [X6,X1,X2,X3,X5] :
( ( member(X5,X2)
& member(X3,X1) )
=> ( apply(X6,X3,X5)
<=> apply(inverse_function(X6,X1,X2),X5,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',inverse_function) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X1,X2] :
( ( one_to_one(X6,X1,X2)
& maps(X6,X1,X2) )
=> equal_maps(inverse_function(inverse_function(X6,X1,X2),X2,X1),X6,X1,X2) ),
inference(assume_negation,[status(cth)],[thII11]) ).
fof(c_0_5,negated_conjecture,
( ~ equal_maps(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)
& one_to_one(esk41_0,esk42_0,esk43_0)
& maps(esk41_0,esk42_0,esk43_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X99,X100,X101,X102,X103,X104,X105,X106,X107,X108,X109] :
( ( equal_maps(X106,X107,X108,X109)
| esk15_4(X106,X107,X108,X109) != esk16_4(X106,X107,X108,X109) )
& ( equal_maps(X106,X107,X108,X109)
| apply(X107,esk14_4(X106,X107,X108,X109),esk16_4(X106,X107,X108,X109)) )
& ( equal_maps(X106,X107,X108,X109)
| apply(X106,esk14_4(X106,X107,X108,X109),esk15_4(X106,X107,X108,X109)) )
& ( equal_maps(X106,X107,X108,X109)
| member(esk16_4(X106,X107,X108,X109),X109) )
& ( equal_maps(X106,X107,X108,X109)
| member(esk15_4(X106,X107,X108,X109),X109) )
& ( equal_maps(X106,X107,X108,X109)
| member(esk14_4(X106,X107,X108,X109),X108) )
& ( X104 = X105
| ~ apply(X100,X103,X105)
| ~ apply(X99,X103,X104)
| ~ member(X105,X102)
| ~ member(X104,X102)
| ~ member(X103,X101)
| ~ equal_maps(X99,X100,X101,X102) ) ),
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)],[equal_maps])])])])])])]) ).
fof(c_0_7,plain,
! [X54,X55,X56,X57,X59,X60,X61,X62,X63,X64,X66] :
( ( maps(X62,X63,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| ~ member(X66,X64)
| esk7_3(X62,X63,X64) != esk8_3(X62,X63,X64) )
& ( maps(X62,X63,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| ~ member(X66,X64)
| apply(X62,esk6_3(X62,X63,X64),esk8_3(X62,X63,X64)) )
& ( maps(X62,X63,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| ~ member(X66,X64)
| apply(X62,esk6_3(X62,X63,X64),esk7_3(X62,X63,X64)) )
& ( maps(X62,X63,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| ~ member(X66,X64)
| member(esk8_3(X62,X63,X64),X64) )
& ( maps(X62,X63,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| ~ member(X66,X64)
| member(esk7_3(X62,X63,X64),X64) )
& ( maps(X62,X63,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| ~ member(X66,X64)
| member(esk6_3(X62,X63,X64),X63) )
& ( maps(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| esk7_3(X62,X63,X64) != esk8_3(X62,X63,X64) )
& ( maps(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| apply(X62,esk6_3(X62,X63,X64),esk8_3(X62,X63,X64)) )
& ( maps(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| apply(X62,esk6_3(X62,X63,X64),esk7_3(X62,X63,X64)) )
& ( maps(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| member(esk8_3(X62,X63,X64),X64) )
& ( maps(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| member(esk7_3(X62,X63,X64),X64) )
& ( maps(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| member(esk6_3(X62,X63,X64),X63) )
& ( ~ maps(X54,X55,X56)
| X60 = X61
| ~ apply(X54,X59,X61)
| ~ apply(X54,X59,X60)
| ~ member(X61,X56)
| ~ member(X60,X56)
| ~ member(X59,X55) )
& ( ~ maps(X54,X55,X56)
| ~ member(X57,X55)
| apply(X54,X57,esk4_4(X54,X55,X56,X57)) )
& ( ~ maps(X54,X55,X56)
| ~ member(X57,X55)
| member(esk4_4(X54,X55,X56,X57),X56) ) ),
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)],[maps])])])])])])]) ).
cnf(c_0_8,negated_conjecture,
~ equal_maps(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( equal_maps(X2,X1,X3,X4)
| apply(X1,esk14_4(X2,X1,X3,X4),esk16_4(X2,X1,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X156,X157,X158,X159,X160] :
( ( ~ member(X160,X158)
| ~ member(X159,X157)
| apply(X156,X159,X160)
| ~ apply(inverse_function(X156,X157,X158),X160,X159) )
& ( ~ member(X160,X158)
| ~ member(X159,X157)
| apply(inverse_function(X156,X157,X158),X160,X159)
| ~ apply(X156,X159,X160) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inverse_function])])])]) ).
cnf(c_0_11,plain,
( equal_maps(X1,X2,X3,X4)
| apply(X1,esk14_4(X1,X2,X3,X4),esk15_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk15_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk14_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ maps(X6,X2,X4)
| ~ apply(X6,X1,X5)
| ~ apply(X6,X1,X3)
| ~ member(X5,X4)
| ~ member(X3,X4)
| ~ member(X1,X2)
| X3 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk16_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( ~ member(X4,X3)
| ~ member(X5,X2)
| ~ apply(inverse_function(X1,X2,X3),X4,X5)
| apply(X1,X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
apply(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_19,negated_conjecture,
member(esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk43_0),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
member(esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk42_0),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(X1,X3)
| ~ member(esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),X2)
| ~ member(esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),X3)
| ~ maps(esk41_0,X2,X3)
| ~ apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),X1)
| X1 = esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
maps(esk41_0,esk42_0,esk43_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
member(esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk43_0),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
apply(inverse_function(esk41_0,esk42_0,esk43_0),esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X1,esk43_0)
| ~ apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),X1)
| X1 = esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_20]),c_0_19])]) ).
cnf(c_0_27,plain,
( esk15_4(X1,X2,X3,X4) != esk16_4(X1,X2,X3,X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,negated_conjecture,
esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0) = esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET720+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:34:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 8.69/1.77 % Version: 3.5.1
% 8.69/1.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 8.69/1.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.69/1.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.69/1.77 % Starting new_bool_3 with 300s (1) cores
% 8.69/1.77 % Starting new_bool_1 with 300s (1) cores
% 8.69/1.77 % Starting sh5l with 300s (1) cores
% 8.69/1.77 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 121289 completed with status 0
% 8.69/1.77 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 8.69/1.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 8.69/1.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.69/1.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.69/1.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.69/1.77 % No SInE strategy applied
% 8.69/1.77 % Search class: FGHSF-FSLF33-SFFFFFNN
% 8.69/1.77 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.69/1.77 % Starting SubtermCWHack with 136s (1) cores
% 8.69/1.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 8.69/1.77 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 239s (1) cores
% 8.69/1.77 % Starting new_bool_3 with 239s (1) cores
% 8.69/1.77 % Starting new_bool_1 with 239s (1) cores
% 8.69/1.77 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 121298 completed with status 0
% 8.69/1.77 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 8.69/1.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 8.69/1.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.69/1.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 8.69/1.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.69/1.77 % No SInE strategy applied
% 8.69/1.77 % Search class: FGHSF-FSLF33-SFFFFFNN
% 8.69/1.77 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.69/1.77 % Starting SubtermCWHack with 136s (1) cores
% 8.69/1.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 8.69/1.77 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 239s (1) cores
% 8.69/1.77 % Preprocessing time : 0.005 s
% 8.69/1.77
% 8.69/1.77 % Proof found!
% 8.69/1.77 % SZS status Theorem
% 8.69/1.77 % SZS output start CNFRefutation
% See solution above
% 8.69/1.77 % Parsed axioms : 29
% 8.69/1.77 % Removed by relevancy pruning/SinE : 0
% 8.69/1.77 % Initial clauses : 137
% 8.69/1.77 % Removed in clause preprocessing : 0
% 8.69/1.77 % Initial clauses in saturation : 137
% 8.69/1.77 % Processed clauses : 1476
% 8.69/1.77 % ...of these trivial : 72
% 8.69/1.77 % ...subsumed : 7
% 8.69/1.77 % ...remaining for further processing : 1397
% 8.69/1.77 % Other redundant clauses eliminated : 3
% 8.69/1.77 % Clauses deleted for lack of memory : 0
% 8.69/1.77 % Backward-subsumed : 0
% 8.69/1.77 % Backward-rewritten : 160
% 8.69/1.77 % Generated clauses : 57046
% 8.69/1.77 % ...of the previous two non-redundant : 54514
% 8.69/1.77 % ...aggressively subsumed : 0
% 8.69/1.77 % Contextual simplify-reflections : 1
% 8.69/1.77 % Paramodulations : 57041
% 8.69/1.77 % Factorizations : 2
% 8.69/1.77 % NegExts : 0
% 8.69/1.77 % Equation resolutions : 3
% 8.69/1.77 % Disequality decompositions : 0
% 8.69/1.77 % Total rewrite steps : 2975
% 8.69/1.77 % ...of those cached : 2069
% 8.69/1.77 % Propositional unsat checks : 0
% 8.69/1.77 % Propositional check models : 0
% 8.69/1.77 % Propositional check unsatisfiable : 0
% 8.69/1.77 % Propositional clauses : 0
% 8.69/1.77 % Propositional clauses after purity: 0
% 8.69/1.77 % Propositional unsat core size : 0
% 8.69/1.77 % Propositional preprocessing time : 0.000
% 8.69/1.77 % Propositional encoding time : 0.000
% 8.69/1.77 % Propositional solver time : 0.000
% 8.69/1.77 % Success case prop preproc time : 0.000
% 8.69/1.77 % Success case prop encoding time : 0.000
% 8.69/1.77 % Success case prop solver time : 0.000
% 8.69/1.77 % Current number of processed clauses : 1234
% 8.69/1.77 % Positive orientable unit clauses : 592
% 8.69/1.77 % Positive unorientable unit clauses: 0
% 8.69/1.77 % Negative unit clauses : 2
% 8.69/1.77 % Non-unit-clauses : 640
% 8.69/1.77 % Current number of unprocessed clauses: 53084
% 8.69/1.77 % ...number of literals in the above : 85969
% 8.69/1.77 % Current number of archived formulas : 0
% 8.69/1.77 % Current number of archived clauses : 160
% 8.69/1.77 % Clause-clause subsumption calls (NU) : 70742
% 8.69/1.77 % Rec. Clause-clause subsumption calls : 47319
% 8.69/1.77 % Non-unit clause-clause subsumptions : 6
% 8.69/1.77 % Unit Clause-clause subsumption calls : 12547
% 8.69/1.77 % Rewrite failures with RHS unbound : 0
% 8.69/1.77 % BW rewrite match attempts : 1670
% 8.69/1.77 % BW rewrite match successes : 8
% 8.69/1.77 % Condensation attempts : 0
% 8.69/1.77 % Condensation successes : 0
% 8.69/1.77 % Termbank termtop insertions : 1533808
% 8.69/1.77 % Search garbage collected termcells : 3070
% 8.69/1.77
% 8.69/1.77 % -------------------------------------------------
% 8.69/1.77 % User time : 1.207 s
% 8.69/1.77 % System time : 0.064 s
% 8.69/1.77 % Total time : 1.271 s
% 8.69/1.77 % Maximum resident set size: 3948 pages
% 8.69/1.77
% 8.69/1.77 % -------------------------------------------------
% 8.69/1.77 % User time : 5.975 s
% 8.69/1.77 % System time : 0.408 s
% 8.69/1.77 % Total time : 6.383 s
% 8.69/1.77 % Maximum resident set size: 4608 pages
% 8.69/1.77 % E exiting
%------------------------------------------------------------------------------