TSTP Solution File: SEU221+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU221+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:30:59 EDT 2023
% Result : Timeout 0.57s 300.18s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 278 ( 68 equ)
% Maximal formula atoms : 130 ( 7 avg)
% Number of connectives : 410 ( 169 ~; 185 |; 40 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 1 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d8_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
& in(X3,relation_dom(X1))
& apply(X1,X2) = apply(X1,X3) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.53ah7DfAg8/E---3.1_4148.p',d8_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( relation(function_inverse(X1))
& function(function_inverse(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.53ah7DfAg8/E---3.1_4148.p',dt_k2_funct_1) ).
fof(t62_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> one_to_one(function_inverse(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.53ah7DfAg8/E---3.1_4148.p',t62_funct_1) ).
fof(t54_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = function_inverse(X1)
<=> ( relation_dom(X2) = relation_rng(X1)
& ! [X3,X4] :
( ( ( in(X3,relation_rng(X1))
& X4 = apply(X2,X3) )
=> ( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) )
& ( ( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) )
=> ( in(X3,relation_rng(X1))
& X4 = apply(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.53ah7DfAg8/E---3.1_4148.p',t54_funct_1) ).
fof(t57_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(X2)
& in(X1,relation_rng(X2)) )
=> ( X1 = apply(X2,apply(function_inverse(X2),X1))
& X1 = apply(relation_composition(function_inverse(X2),X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.53ah7DfAg8/E---3.1_4148.p',t57_funct_1) ).
fof(c_0_5,plain,
! [X31,X32,X33] :
( ( ~ one_to_one(X31)
| ~ in(X32,relation_dom(X31))
| ~ in(X33,relation_dom(X31))
| apply(X31,X32) != apply(X31,X33)
| X32 = X33
| ~ relation(X31)
| ~ function(X31) )
& ( in(esk13_1(X31),relation_dom(X31))
| one_to_one(X31)
| ~ relation(X31)
| ~ function(X31) )
& ( in(esk14_1(X31),relation_dom(X31))
| one_to_one(X31)
| ~ relation(X31)
| ~ function(X31) )
& ( apply(X31,esk13_1(X31)) = apply(X31,esk14_1(X31))
| one_to_one(X31)
| ~ relation(X31)
| ~ function(X31) )
& ( esk13_1(X31) != esk14_1(X31)
| one_to_one(X31)
| ~ relation(X31)
| ~ function(X31) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_funct_1])])])])]) ).
fof(c_0_6,plain,
! [X8] :
( ( relation(function_inverse(X8))
| ~ relation(X8)
| ~ function(X8) )
& ( function(function_inverse(X8))
| ~ relation(X8)
| ~ function(X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> one_to_one(function_inverse(X1)) ) ),
inference(assume_negation,[status(cth)],[t62_funct_1]) ).
cnf(c_0_8,plain,
( in(esk14_1(X1),relation_dom(X1))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( relation(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( function(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( relation(esk1_0)
& function(esk1_0)
& one_to_one(esk1_0)
& ~ one_to_one(function_inverse(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( relation_dom(X10) = relation_rng(X9)
| X10 != function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( in(X12,relation_dom(X9))
| ~ in(X11,relation_rng(X9))
| X12 != apply(X10,X11)
| X10 != function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( X11 = apply(X9,X12)
| ~ in(X11,relation_rng(X9))
| X12 != apply(X10,X11)
| X10 != function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( in(X13,relation_rng(X9))
| ~ in(X14,relation_dom(X9))
| X13 != apply(X9,X14)
| X10 != function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( X14 = apply(X10,X13)
| ~ in(X14,relation_dom(X9))
| X13 != apply(X9,X14)
| X10 != function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( in(esk6_2(X9,X10),relation_dom(X9))
| in(esk3_2(X9,X10),relation_rng(X9))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( esk5_2(X9,X10) = apply(X9,esk6_2(X9,X10))
| in(esk3_2(X9,X10),relation_rng(X9))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( ~ in(esk5_2(X9,X10),relation_rng(X9))
| esk6_2(X9,X10) != apply(X10,esk5_2(X9,X10))
| in(esk3_2(X9,X10),relation_rng(X9))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( in(esk6_2(X9,X10),relation_dom(X9))
| esk4_2(X9,X10) = apply(X10,esk3_2(X9,X10))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( esk5_2(X9,X10) = apply(X9,esk6_2(X9,X10))
| esk4_2(X9,X10) = apply(X10,esk3_2(X9,X10))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( ~ in(esk5_2(X9,X10),relation_rng(X9))
| esk6_2(X9,X10) != apply(X10,esk5_2(X9,X10))
| esk4_2(X9,X10) = apply(X10,esk3_2(X9,X10))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( in(esk6_2(X9,X10),relation_dom(X9))
| ~ in(esk4_2(X9,X10),relation_dom(X9))
| esk3_2(X9,X10) != apply(X9,esk4_2(X9,X10))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( esk5_2(X9,X10) = apply(X9,esk6_2(X9,X10))
| ~ in(esk4_2(X9,X10),relation_dom(X9))
| esk3_2(X9,X10) != apply(X9,esk4_2(X9,X10))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) )
& ( ~ in(esk5_2(X9,X10),relation_rng(X9))
| esk6_2(X9,X10) != apply(X10,esk5_2(X9,X10))
| ~ in(esk4_2(X9,X10),relation_dom(X9))
| esk3_2(X9,X10) != apply(X9,esk4_2(X9,X10))
| relation_dom(X10) != relation_rng(X9)
| X10 = function_inverse(X9)
| ~ relation(X10)
| ~ function(X10)
| ~ one_to_one(X9)
| ~ relation(X9)
| ~ function(X9) ) ),
inference(distribute,[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)],[t54_funct_1])])])])])]) ).
cnf(c_0_13,plain,
( apply(X1,esk13_1(X1)) = apply(X1,esk14_1(X1))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( one_to_one(function_inverse(X1))
| in(esk14_1(function_inverse(X1)),relation_dom(function_inverse(X1)))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ one_to_one(function_inverse(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( relation_dom(X1) = relation_rng(X2)
| X1 != function_inverse(X2)
| ~ relation(X1)
| ~ function(X1)
| ~ one_to_one(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( in(esk13_1(X1),relation_dom(X1))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_20,plain,
! [X19,X20] :
( ( X19 = apply(X20,apply(function_inverse(X20),X19))
| ~ one_to_one(X20)
| ~ in(X19,relation_rng(X20))
| ~ relation(X20)
| ~ function(X20) )
& ( X19 = apply(relation_composition(function_inverse(X20),X20),X19)
| ~ one_to_one(X20)
| ~ in(X19,relation_rng(X20))
| ~ relation(X20)
| ~ function(X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t57_funct_1])])]) ).
cnf(c_0_21,plain,
( apply(function_inverse(X1),esk14_1(function_inverse(X1))) = apply(function_inverse(X1),esk13_1(function_inverse(X1)))
| one_to_one(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_10]) ).
cnf(c_0_22,negated_conjecture,
in(esk14_1(function_inverse(esk1_0)),relation_dom(function_inverse(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_23,plain,
( relation_dom(function_inverse(X1)) = relation_rng(X1)
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_10]),c_0_9]) ).
cnf(c_0_24,negated_conjecture,
one_to_one(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
( one_to_one(function_inverse(X1))
| in(esk13_1(function_inverse(X1)),relation_dom(function_inverse(X1)))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_9]),c_0_10]) ).
cnf(c_0_26,plain,
( X1 = apply(X2,apply(function_inverse(X2),X1))
| ~ one_to_one(X2)
| ~ in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
apply(function_inverse(esk1_0),esk14_1(function_inverse(esk1_0))) = apply(function_inverse(esk1_0),esk13_1(function_inverse(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
in(esk14_1(function_inverse(esk1_0)),relation_rng(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_15]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
in(esk13_1(function_inverse(esk1_0)),relation_dom(function_inverse(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_30,negated_conjecture,
apply(esk1_0,apply(function_inverse(esk1_0),esk13_1(function_inverse(esk1_0)))) = esk14_1(function_inverse(esk1_0)),
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_26,c_0_27]),c_0_24]),c_0_15]),c_0_16]),c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
in(esk13_1(function_inverse(esk1_0)),relation_rng(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_24]),c_0_15]),c_0_16])]) ).
cnf(c_0_32,plain,
( one_to_one(X1)
| esk13_1(X1) != esk14_1(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
esk14_1(function_inverse(esk1_0)) = esk13_1(function_inverse(esk1_0)),
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_26,c_0_30]),c_0_24]),c_0_15]),c_0_16]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
( ~ relation(function_inverse(esk1_0))
| ~ function(function_inverse(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
~ relation(function_inverse(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_10]),c_0_15]),c_0_16])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_9]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU221+3 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:43:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.53ah7DfAg8/E---3.1_4148.p
% 0.57/300.18 # Version: 3.1pre001
% 0.57/300.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.57/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/300.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.57/300.18 # Starting new_bool_3 with 300s (1) cores
% 0.57/300.18 # Starting new_bool_1 with 300s (1) cores
% 0.57/300.18 # Starting sh5l with 300s (1) cores
% 0.57/300.18 # new_bool_3 with pid 4240 completed with status 0
% 0.57/300.18 # Result found by new_bool_3
% 0.57/300.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.57/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/300.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.57/300.18 # Starting new_bool_3 with 300s (1) cores
% 0.57/300.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.57/300.18 # Search class: FGHSS-FFMM21-MFFFFFNN
% 0.57/300.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.57/300.18 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.57/300.18 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 4244 completed with status 0
% 0.57/300.18 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.57/300.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.57/300.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/300.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.57/300.18 # Starting new_bool_3 with 300s (1) cores
% 0.57/300.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.57/300.18 # Search class: FGHSS-FFMM21-MFFFFFNN
% 0.57/300.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.57/300.18 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.57/300.18 # Preprocessing time : 0.002 s
% 0.57/300.18 # Presaturation interreduction done
% 0.57/300.18
% 0.57/300.18 # Proof found!
% 0.57/300.18 # SZS status Theorem
% 0.57/300.18 # SZS output start CNFRefutation
% See solution above
% 0.57/300.18 # Parsed axioms : 41
% 0.57/300.18 # Removed by relevancy pruning/SinE : 7
% 0.57/300.18 # Initial clauses : 72
% 0.57/300.18 # Removed in clause preprocessing : 2
% 0.57/300.18 # Initial clauses in saturation : 70
% 0.57/300.18 # Processed clauses : 554
% 0.57/300.18 # ...of these trivial : 4
% 0.57/300.18 # ...subsumed : 245
% 0.57/300.18 # ...remaining for further processing : 305
% 0.57/300.18 # Other redundant clauses eliminated : 9
% 0.57/300.18 # Clauses deleted for lack of memory : 0
% 0.57/300.18 # Backward-subsumed : 7
% 0.57/300.18 # Backward-rewritten : 32
% 0.57/300.18 # Generated clauses : 1231
% 0.57/300.18 # ...of the previous two non-redundant : 1009
% 0.57/300.18 # ...aggressively subsumed : 0
% 0.57/300.18 # Contextual simplify-reflections : 39
% 0.57/300.18 # Paramodulations : 1226
% 0.57/300.18 # Factorizations : 0
% 0.57/300.18 # NegExts : 0
% 0.57/300.18 # Equation resolutions : 9
% 0.57/300.18 # Total rewrite steps : 830
% 0.57/300.18 # Propositional unsat checks : 0
% 0.57/300.18 # Propositional check models : 0
% 0.57/300.18 # Propositional check unsatisfiable : 0
% 0.57/300.18 # Propositional clauses : 0
% 0.57/300.18 # Propositional clauses after purity: 0
% 0.57/300.18 # Propositional unsat core size : 0
% 0.57/300.18 # Propositional preprocessing time : 0.000
% 0.57/300.18 # Propositional encoding time : 0.000
% 0.57/300.18 # Propositional solver time : 0.000
% 0.57/300.18 # Success case prop preproc time : 0.000
% 0.57/300.18 # Success case prop encoding time : 0.000
% 0.57/300.18 # Success case prop solver time : 0.000
% 0.57/300.18 # Current number of processed clauses : 193
% 0.57/300.18 # Positive orientable unit clauses : 25
% 0.57/300.18 # Positive unorientable unit clauses: 0
% 0.57/300.18 # Negative unit clauses : 14
% 0.57/300.18 # Non-unit-clauses : 154
% 0.57/300.18 # Current number of unprocessed clauses: 515
% 0.57/300.18 # ...number of literals in the above : 2768
% 0.57/300.18 # Current number of archived formulas : 0
% 0.57/300.18 # Current number of archived clauses : 107
% 0.57/300.18 # Clause-clause subsumption calls (NU) : 7431
% 0.57/300.18 # Rec. Clause-clause subsumption calls : 3055
% 0.57/300.18 # Non-unit clause-clause subsumptions : 184
% 0.57/300.18 # Unit Clause-clause subsumption calls : 652
% 0.57/300.18 # Rewrite failures with RHS unbound : 0
% 0.57/300.18 # BW rewrite match attempts : 11
% 0.57/300.18 # BW rewrite match successes : 9
% 0.57/300.18 # Condensation attempts : 0
% 0.57/300.18 # Condensation successes : 0
% 0.57/300.18 # Termbank termtop insertions : 22911
% 0.57/300.18
% 0.57/300.18 # -------------------------------------------------
% 0.57/300.18 # User time : 0.034 s
% 0.57/300.18 # System time : 0.004 s
% 0.57/300.18 # Total time : 0.038 s
% 0.57/300.18 # Maximum resident set size: 1876 pages
% 0.57/300.18
% 0.57/300.18 # -------------------------------------------------
% 0.57/300.18 # User time : 0.035 s
% 0.57/300.18 # System time : 0.006 s
% 0.57/300.18 # Total time : 0.041 s
% 0.57/300.18 # Maximum resident set size: 1732 pages
% 0.57/300.18 % E---3.1 exiting
%------------------------------------------------------------------------------