%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU221+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:28:35 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : CNFRefutation 0.18s
% 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] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
<=> ! [X2,X3] :
( ( apply(X1,X2) = apply(X1,X3)
& in(X3,relation_dom(X1))
& in(X2,relation_dom(X1)) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( function(function_inverse(X1))
& relation(function_inverse(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(t62_funct_1,conjecture,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> one_to_one(function_inverse(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t62_funct_1) ).
fof(t54_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( X2 = function_inverse(X1)
<=> ( ! [X3,X4] :
( ( ( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) )
=> ( X4 = apply(X2,X3)
& in(X3,relation_rng(X1)) ) )
& ( ( X4 = apply(X2,X3)
& in(X3,relation_rng(X1)) )
=> ( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) ) ) )
& relation_dom(X2) = relation_rng(X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t54_funct_1) ).
fof(t57_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( ( in(X1,relation_rng(X2))
& one_to_one(X2) )
=> ( X1 = apply(relation_composition(function_inverse(X2),X2),X1)
& X1 = apply(X2,apply(function_inverse(X2),X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_funct_1) ).
fof(c_0_5,plain,
! [X10,X11,X12] :
( ( ~ function(X10)
| ~ relation(X10)
| one_to_one(X10)
| esk1_1(X10) != esk2_1(X10) )
& ( ~ function(X10)
| ~ relation(X10)
| one_to_one(X10)
| apply(X10,esk1_1(X10)) = apply(X10,esk2_1(X10)) )
& ( ~ function(X10)
| ~ relation(X10)
| one_to_one(X10)
| in(esk2_1(X10),relation_dom(X10)) )
& ( ~ function(X10)
| ~ relation(X10)
| one_to_one(X10)
| in(esk1_1(X10),relation_dom(X10)) )
& ( ~ function(X10)
| ~ relation(X10)
| X11 = X12
| apply(X10,X11) != apply(X10,X12)
| ~ in(X12,relation_dom(X10))
| ~ in(X11,relation_dom(X10))
| ~ one_to_one(X10) ) ),
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)],[d8_funct_1])])])])])]) ).
fof(c_0_6,plain,
! [X15] :
( ( ~ function(X15)
| ~ relation(X15)
| function(function_inverse(X15)) )
& ( ~ function(X15)
| ~ relation(X15)
| relation(function_inverse(X15)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> one_to_one(function_inverse(X1)) ) ),
inference(assume_negation,[status(cth)],[t62_funct_1]) ).
cnf(c_0_8,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ function(X1)
| ~ relation(X1)
| relation(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ function(X1)
| ~ relation(X1)
| function(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( ~ one_to_one(function_inverse(esk18_0))
& one_to_one(esk18_0)
& function(esk18_0)
& relation(esk18_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_12,plain,
! [X53,X54,X55,X56,X57,X58] :
( ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| esk14_2(X53,X54) != apply(X53,esk15_2(X53,X54))
| ~ in(esk15_2(X53,X54),relation_dom(X53))
| esk17_2(X53,X54) != apply(X54,esk16_2(X53,X54))
| ~ in(esk16_2(X53,X54),relation_rng(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| esk14_2(X53,X54) != apply(X53,esk15_2(X53,X54))
| ~ in(esk15_2(X53,X54),relation_dom(X53))
| esk16_2(X53,X54) = apply(X53,esk17_2(X53,X54)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| esk14_2(X53,X54) != apply(X53,esk15_2(X53,X54))
| ~ in(esk15_2(X53,X54),relation_dom(X53))
| in(esk17_2(X53,X54),relation_dom(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| esk15_2(X53,X54) = apply(X54,esk14_2(X53,X54))
| esk17_2(X53,X54) != apply(X54,esk16_2(X53,X54))
| ~ in(esk16_2(X53,X54),relation_rng(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| esk15_2(X53,X54) = apply(X54,esk14_2(X53,X54))
| esk16_2(X53,X54) = apply(X53,esk17_2(X53,X54)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| esk15_2(X53,X54) = apply(X54,esk14_2(X53,X54))
| in(esk17_2(X53,X54),relation_dom(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| in(esk14_2(X53,X54),relation_rng(X53))
| esk17_2(X53,X54) != apply(X54,esk16_2(X53,X54))
| ~ in(esk16_2(X53,X54),relation_rng(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| in(esk14_2(X53,X54),relation_rng(X53))
| esk16_2(X53,X54) = apply(X53,esk17_2(X53,X54)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 = function_inverse(X53)
| relation_dom(X54) != relation_rng(X53)
| in(esk14_2(X53,X54),relation_rng(X53))
| in(esk17_2(X53,X54),relation_dom(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 != function_inverse(X53)
| X57 != apply(X53,X58)
| ~ in(X58,relation_dom(X53))
| X58 = apply(X54,X57) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 != function_inverse(X53)
| X57 != apply(X53,X58)
| ~ in(X58,relation_dom(X53))
| in(X57,relation_rng(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 != function_inverse(X53)
| X56 != apply(X54,X55)
| ~ in(X55,relation_rng(X53))
| X55 = apply(X53,X56) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 != function_inverse(X53)
| X56 != apply(X54,X55)
| ~ in(X55,relation_rng(X53))
| in(X56,relation_dom(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| ~ function(X54)
| ~ relation(X54)
| X54 != function_inverse(X53)
| relation_dom(X54) = relation_rng(X53) ) ),
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)],[t54_funct_1])])])])])])]) ).
cnf(c_0_13,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(X1)
| apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ function(X1)
| ~ relation(X1)
| in(esk2_1(function_inverse(X1)),relation_dom(function_inverse(X1)))
| one_to_one(function_inverse(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(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
function(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ one_to_one(function_inverse(esk18_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ one_to_one(X2)
| ~ function(X1)
| ~ relation(X1)
| X1 != function_inverse(X2)
| relation_dom(X1) = relation_rng(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(X1)
| in(esk1_1(X1),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_20,plain,
! [X63,X64] :
( ( ~ function(X64)
| ~ relation(X64)
| ~ in(X63,relation_rng(X64))
| ~ one_to_one(X64)
| X63 = apply(relation_composition(function_inverse(X64),X64),X63) )
& ( ~ function(X64)
| ~ relation(X64)
| ~ in(X63,relation_rng(X64))
| ~ one_to_one(X64)
| X63 = apply(X64,apply(function_inverse(X64),X63)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t57_funct_1])])])]) ).
cnf(c_0_21,plain,
( ~ function(X1)
| ~ relation(X1)
| one_to_one(function_inverse(X1))
| apply(function_inverse(X1),esk2_1(function_inverse(X1))) = apply(function_inverse(X1),esk1_1(function_inverse(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(esk2_1(function_inverse(esk18_0)),relation_dom(function_inverse(esk18_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,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| relation_dom(function_inverse(X1)) = relation_rng(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(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
( ~ function(X1)
| ~ relation(X1)
| in(esk1_1(function_inverse(X1)),relation_dom(function_inverse(X1)))
| one_to_one(function_inverse(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_9]),c_0_10]) ).
cnf(c_0_26,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ in(X1,relation_rng(X2))
| ~ one_to_one(X2)
| X1 = apply(X2,apply(function_inverse(X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
apply(function_inverse(esk18_0),esk2_1(function_inverse(esk18_0))) = apply(function_inverse(esk18_0),esk1_1(function_inverse(esk18_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(esk2_1(function_inverse(esk18_0)),relation_rng(esk18_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(esk1_1(function_inverse(esk18_0)),relation_dom(function_inverse(esk18_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(esk18_0,apply(function_inverse(esk18_0),esk1_1(function_inverse(esk18_0)))) = esk2_1(function_inverse(esk18_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(esk1_1(function_inverse(esk18_0)),relation_rng(esk18_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,
( ~ function(X1)
| ~ relation(X1)
| esk1_1(X1) != esk2_1(X1)
| one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
esk2_1(function_inverse(esk18_0)) = esk1_1(function_inverse(esk18_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,
( ~ function(function_inverse(esk18_0))
| ~ relation(function_inverse(esk18_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(esk18_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.00/0.03 % Problem : SEU221+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 06:02:38 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 0.18/0.48 % Version: 3.5.1
% 0.18/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 % Starting sh5l with 300s (1) cores
% 0.18/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1521687 completed with status 0
% 0.18/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.48 % No SInE strategy applied
% 0.18/0.48 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.18/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.48 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.18/0.48 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.18/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.18/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1521693 completed with status 0
% 0.18/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.48 % No SInE strategy applied
% 0.18/0.48 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.18/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.48 % Preprocessing time : 0.002 s
% 0.18/0.48 % Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 % Proof found!
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 % SZS output start CNFRefutation
% See solution above
% 0.18/0.48 % Parsed axioms : 41
% 0.18/0.48 % Removed by relevancy pruning/SinE : 0
% 0.18/0.48 % Initial clauses : 84
% 0.18/0.48 % Removed in clause preprocessing : 2
% 0.18/0.48 % Initial clauses in saturation : 82
% 0.18/0.48 % Processed clauses : 538
% 0.18/0.48 % ...of these trivial : 5
% 0.18/0.48 % ...subsumed : 225
% 0.18/0.48 % ...remaining for further processing : 308
% 0.18/0.48 % Other redundant clauses eliminated : 9
% 0.18/0.48 % Clauses deleted for lack of memory : 0
% 0.18/0.48 % Backward-subsumed : 4
% 0.18/0.48 % Backward-rewritten : 18
% 0.18/0.48 % Generated clauses : 1184
% 0.18/0.48 % ...of the previous two non-redundant : 940
% 0.18/0.48 % ...aggressively subsumed : 0
% 0.18/0.48 % Contextual simplify-reflections : 29
% 0.18/0.48 % Paramodulations : 1179
% 0.18/0.48 % Factorizations : 0
% 0.18/0.48 % NegExts : 0
% 0.18/0.48 % Equation resolutions : 9
% 0.18/0.48 % Disequality decompositions : 0
% 0.18/0.48 % Total rewrite steps : 599
% 0.18/0.48 % ...of those cached : 568
% 0.18/0.48 % Propositional unsat checks : 0
% 0.18/0.48 % Propositional check models : 0
% 0.18/0.48 % Propositional check unsatisfiable : 0
% 0.18/0.48 % Propositional clauses : 0
% 0.18/0.48 % Propositional clauses after purity: 0
% 0.18/0.48 % Propositional unsat core size : 0
% 0.18/0.48 % Propositional preprocessing time : 0.000
% 0.18/0.48 % Propositional encoding time : 0.000
% 0.18/0.48 % Propositional solver time : 0.000
% 0.18/0.48 % Success case prop preproc time : 0.000
% 0.18/0.48 % Success case prop encoding time : 0.000
% 0.18/0.48 % Success case prop solver time : 0.000
% 0.18/0.48 % Current number of processed clauses : 204
% 0.18/0.48 % Positive orientable unit clauses : 30
% 0.18/0.48 % Positive unorientable unit clauses: 0
% 0.18/0.48 % Negative unit clauses : 14
% 0.18/0.48 % Non-unit-clauses : 160
% 0.18/0.48 % Current number of unprocessed clauses: 540
% 0.18/0.48 % ...number of literals in the above : 2702
% 0.18/0.48 % Current number of archived formulas : 0
% 0.18/0.48 % Current number of archived clauses : 99
% 0.18/0.48 % Clause-clause subsumption calls (NU) : 10409
% 0.18/0.48 % Rec. Clause-clause subsumption calls : 5078
% 0.18/0.48 % Non-unit clause-clause subsumptions : 176
% 0.18/0.48 % Unit Clause-clause subsumption calls : 658
% 0.18/0.48 % Rewrite failures with RHS unbound : 0
% 0.18/0.48 % BW rewrite match attempts : 8
% 0.18/0.48 % BW rewrite match successes : 6
% 0.18/0.48 % Condensation attempts : 0
% 0.18/0.48 % Condensation successes : 0
% 0.18/0.48 % Termbank termtop insertions : 22564
% 0.18/0.48 % Search garbage collected termcells : 1039
% 0.18/0.48
% 0.18/0.48 % -------------------------------------------------
% 0.18/0.48 % User time : 0.039 s
% 0.18/0.48 % System time : 0.008 s
% 0.18/0.48 % Total time : 0.047 s
% 0.18/0.48 % Maximum resident set size: 3668 pages
% 0.18/0.48
% 0.18/0.48 % -------------------------------------------------
% 0.18/0.48 % User time : 0.167 s
% 0.18/0.48 % System time : 0.022 s
% 0.18/0.48 % Total time : 0.189 s
% 0.18/0.48 % Maximum resident set size: 4864 pages
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------