%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU221+1 : TPTP v9.3.1. Released v3.3.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:24:19 PM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% 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(esk16_0))
& one_to_one(esk16_0)
& function(esk16_0)
& relation(esk16_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,
! [X42,X43,X44,X45,X46,X47] :
( ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| esk12_2(X42,X43) != apply(X42,esk13_2(X42,X43))
| ~ in(esk13_2(X42,X43),relation_dom(X42))
| esk15_2(X42,X43) != apply(X43,esk14_2(X42,X43))
| ~ in(esk14_2(X42,X43),relation_rng(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| esk12_2(X42,X43) != apply(X42,esk13_2(X42,X43))
| ~ in(esk13_2(X42,X43),relation_dom(X42))
| esk14_2(X42,X43) = apply(X42,esk15_2(X42,X43)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| esk12_2(X42,X43) != apply(X42,esk13_2(X42,X43))
| ~ in(esk13_2(X42,X43),relation_dom(X42))
| in(esk15_2(X42,X43),relation_dom(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| esk13_2(X42,X43) = apply(X43,esk12_2(X42,X43))
| esk15_2(X42,X43) != apply(X43,esk14_2(X42,X43))
| ~ in(esk14_2(X42,X43),relation_rng(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| esk13_2(X42,X43) = apply(X43,esk12_2(X42,X43))
| esk14_2(X42,X43) = apply(X42,esk15_2(X42,X43)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| esk13_2(X42,X43) = apply(X43,esk12_2(X42,X43))
| in(esk15_2(X42,X43),relation_dom(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| in(esk12_2(X42,X43),relation_rng(X42))
| esk15_2(X42,X43) != apply(X43,esk14_2(X42,X43))
| ~ in(esk14_2(X42,X43),relation_rng(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| in(esk12_2(X42,X43),relation_rng(X42))
| esk14_2(X42,X43) = apply(X42,esk15_2(X42,X43)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 = function_inverse(X42)
| relation_dom(X43) != relation_rng(X42)
| in(esk12_2(X42,X43),relation_rng(X42))
| in(esk15_2(X42,X43),relation_dom(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 != function_inverse(X42)
| X46 != apply(X42,X47)
| ~ in(X47,relation_dom(X42))
| X47 = apply(X43,X46) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 != function_inverse(X42)
| X46 != apply(X42,X47)
| ~ in(X47,relation_dom(X42))
| in(X46,relation_rng(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 != function_inverse(X42)
| X45 != apply(X43,X44)
| ~ in(X44,relation_rng(X42))
| X44 = apply(X42,X45) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 != function_inverse(X42)
| X45 != apply(X43,X44)
| ~ in(X44,relation_rng(X42))
| in(X45,relation_dom(X42)) )
& ( ~ function(X42)
| ~ relation(X42)
| ~ one_to_one(X42)
| ~ function(X43)
| ~ relation(X43)
| X43 != function_inverse(X42)
| relation_dom(X43) = relation_rng(X42) ) ),
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(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
function(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ one_to_one(function_inverse(esk16_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,
! [X52,X53] :
( ( ~ function(X53)
| ~ relation(X53)
| ~ in(X52,relation_rng(X53))
| ~ one_to_one(X53)
| X52 = apply(relation_composition(function_inverse(X53),X53),X52) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ in(X52,relation_rng(X53))
| ~ one_to_one(X53)
| X52 = apply(X53,apply(function_inverse(X53),X52)) ) ),
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(esk16_0)),relation_dom(function_inverse(esk16_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(esk16_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(esk16_0),esk2_1(function_inverse(esk16_0))) = apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_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(esk16_0)),relation_rng(esk16_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(esk16_0)),relation_dom(function_inverse(esk16_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(esk16_0,apply(function_inverse(esk16_0),esk1_1(function_inverse(esk16_0)))) = esk2_1(function_inverse(esk16_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(esk16_0)),relation_rng(esk16_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(esk16_0)) = esk1_1(function_inverse(esk16_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(esk16_0))
| ~ relation(function_inverse(esk16_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(esk16_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+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n026.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:02:06 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1520142 completed with status 0
% 0.15/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.15/0.47 % Starting SAT001_MinMin_p005000_rr_RG with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 151s (1) cores
% 0.15/0.47 % Starting new_bool_3 with 146s (1) cores
% 0.15/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1520153 completed with status 0
% 0.15/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.47 % No SInE strategy applied
% 0.15/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 % Starting SubtermCWHack with 151s (1) cores
% 0.15/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 901s (1) cores
% 0.15/0.47 % Preprocessing time : 0.002 s
% 0.15/0.47 % Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Theorem
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 39
% 0.15/0.47 % Removed by relevancy pruning/SinE : 0
% 0.15/0.47 % Initial clauses : 79
% 0.15/0.47 % Removed in clause preprocessing : 7
% 0.15/0.47 % Initial clauses in saturation : 72
% 0.15/0.47 % Processed clauses : 500
% 0.15/0.47 % ...of these trivial : 5
% 0.15/0.47 % ...subsumed : 229
% 0.15/0.47 % ...remaining for further processing : 266
% 0.15/0.47 % Other redundant clauses eliminated : 9
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 8
% 0.15/0.47 % Backward-rewritten : 17
% 0.15/0.47 % Generated clauses : 1291
% 0.15/0.47 % ...of the previous two non-redundant : 1037
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 30
% 0.15/0.47 % Paramodulations : 1286
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 9
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 645
% 0.15/0.47 % ...of those cached : 619
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 169
% 0.15/0.47 % Positive orientable unit clauses : 23
% 0.15/0.47 % Positive unorientable unit clauses: 0
% 0.15/0.47 % Negative unit clauses : 11
% 0.15/0.47 % Non-unit-clauses : 135
% 0.15/0.47 % Current number of unprocessed clauses: 654
% 0.15/0.47 % ...number of literals in the above : 3350
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 92
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 8194
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 4584
% 0.15/0.47 % Non-unit clause-clause subsumptions : 190
% 0.15/0.47 % Unit Clause-clause subsumption calls : 355
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 7
% 0.15/0.47 % BW rewrite match successes : 5
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 23159
% 0.15/0.47 % Search garbage collected termcells : 948
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.041 s
% 0.15/0.47 % System time : 0.003 s
% 0.15/0.47 % Total time : 0.045 s
% 0.15/0.47 % Maximum resident set size: 3628 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.183 s
% 0.15/0.47 % System time : 0.019 s
% 0.15/0.47 % Total time : 0.202 s
% 0.15/0.47 % Maximum resident set size: 4864 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------