%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU032+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:23:42 PM UTC 2026
% Result : Theorem 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 116 ( 27 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 148 ( 59 ~; 56 |; 19 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( ( relation_composition(X1,X2) = identity_relation(relation_dom(X1))
& relation_rng(X1) = relation_dom(X2)
& one_to_one(X1) )
=> X2 = function_inverse(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_funct_1) ).
fof(t61_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ( relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1))
& relation_composition(X1,function_inverse(X1)) = identity_relation(relation_dom(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t61_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( function(function_inverse(X1))
& relation(function_inverse(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(t62_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> one_to_one(function_inverse(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t62_funct_1) ).
fof(t55_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ( relation_dom(X1) = relation_rng(function_inverse(X1))
& relation_rng(X1) = relation_dom(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_funct_1) ).
fof(t65_funct_1,conjecture,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> function_inverse(function_inverse(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_funct_1) ).
fof(c_0_6,plain,
! [X55,X56] :
( X56 = function_inverse(X55)
| relation_composition(X55,X56) != identity_relation(relation_dom(X55))
| relation_rng(X55) != relation_dom(X56)
| ~ one_to_one(X55)
| ~ function(X56)
| ~ relation(X56)
| ~ function(X55)
| ~ relation(X55) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t63_funct_1])])])]) ).
fof(c_0_7,plain,
! [X53] :
( ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| relation_composition(function_inverse(X53),X53) = identity_relation(relation_rng(X53)) )
& ( ~ function(X53)
| ~ relation(X53)
| ~ one_to_one(X53)
| relation_composition(X53,function_inverse(X53)) = identity_relation(relation_dom(X53)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_funct_1])])])]) ).
fof(c_0_8,plain,
! [X9] :
( ( ~ function(X9)
| ~ relation(X9)
| function(function_inverse(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| relation(function_inverse(X9)) ) ),
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_9,plain,
! [X54] :
( one_to_one(function_inverse(X54))
| ~ one_to_one(X54)
| ~ function(X54)
| ~ relation(X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t62_funct_1])])]) ).
fof(c_0_10,plain,
! [X49] :
( ( ~ function(X49)
| ~ relation(X49)
| ~ one_to_one(X49)
| relation_dom(X49) = relation_rng(function_inverse(X49)) )
& ( ~ function(X49)
| ~ relation(X49)
| ~ one_to_one(X49)
| relation_rng(X49) = relation_dom(function_inverse(X49)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_funct_1])])])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> function_inverse(function_inverse(X1)) = X1 ) ),
inference(assume_negation,[status(cth)],[t65_funct_1]) ).
cnf(c_0_12,plain,
( relation_composition(X1,X2) != identity_relation(relation_dom(X1))
| relation_rng(X1) != relation_dom(X2)
| ~ one_to_one(X1)
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| X2 = function_inverse(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ function(X1)
| ~ relation(X1)
| function(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ function(X1)
| ~ relation(X1)
| relation(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1)
| one_to_one(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| relation_dom(X1) = relation_rng(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,negated_conjecture,
( function_inverse(function_inverse(esk12_0)) != esk12_0
& one_to_one(esk12_0)
& function(esk12_0)
& relation(esk12_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_19,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| identity_relation(relation_dom(function_inverse(X1))) != identity_relation(relation_rng(X1))
| function_inverse(function_inverse(X1)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| relation_rng(X1) = relation_dom(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
function_inverse(function_inverse(esk12_0)) != esk12_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| function_inverse(function_inverse(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
one_to_one(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
relation(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
function(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU032+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/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 05:49:53 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.48 % Version: 3.5.1
% 0.15/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 % Starting sh5l with 300s (1) cores
% 0.15/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1495819 completed with status 0
% 0.15/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48 % No SInE strategy applied
% 0.15/0.48 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.15/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.15/0.48 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.15/0.48 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1495829 completed with status 0
% 0.15/0.48 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.15/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48 % No SInE strategy applied
% 0.15/0.48 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.15/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.48 % Preprocessing time : 0.002 s
% 0.15/0.48
% 0.15/0.48 % Proof found!
% 0.15/0.48 % SZS status Theorem
% 0.15/0.48 % SZS output start CNFRefutation
% See solution above
% 0.15/0.48 % Parsed axioms : 44
% 0.15/0.48 % Removed by relevancy pruning/SinE : 0
% 0.15/0.48 % Initial clauses : 72
% 0.15/0.48 % Removed in clause preprocessing : 2
% 0.15/0.48 % Initial clauses in saturation : 70
% 0.15/0.48 % Processed clauses : 215
% 0.15/0.48 % ...of these trivial : 4
% 0.15/0.48 % ...subsumed : 57
% 0.15/0.48 % ...remaining for further processing : 154
% 0.15/0.48 % Other redundant clauses eliminated : 0
% 0.15/0.48 % Clauses deleted for lack of memory : 0
% 0.15/0.48 % Backward-subsumed : 7
% 0.15/0.48 % Backward-rewritten : 11
% 0.15/0.48 % Generated clauses : 686
% 0.15/0.48 % ...of the previous two non-redundant : 587
% 0.15/0.48 % ...aggressively subsumed : 0
% 0.15/0.48 % Contextual simplify-reflections : 32
% 0.15/0.48 % Paramodulations : 685
% 0.15/0.48 % Factorizations : 0
% 0.15/0.48 % NegExts : 0
% 0.15/0.48 % Equation resolutions : 1
% 0.15/0.48 % Disequality decompositions : 0
% 0.15/0.48 % Total rewrite steps : 142
% 0.15/0.48 % ...of those cached : 118
% 0.15/0.48 % Propositional unsat checks : 0
% 0.15/0.48 % Propositional check models : 0
% 0.15/0.48 % Propositional check unsatisfiable : 0
% 0.15/0.48 % Propositional clauses : 0
% 0.15/0.48 % Propositional clauses after purity: 0
% 0.15/0.48 % Propositional unsat core size : 0
% 0.15/0.48 % Propositional preprocessing time : 0.000
% 0.15/0.48 % Propositional encoding time : 0.000
% 0.15/0.48 % Propositional solver time : 0.000
% 0.15/0.48 % Success case prop preproc time : 0.000
% 0.15/0.48 % Success case prop encoding time : 0.000
% 0.15/0.48 % Success case prop solver time : 0.000
% 0.15/0.48 % Current number of processed clauses : 136
% 0.15/0.48 % Positive orientable unit clauses : 28
% 0.15/0.48 % Positive unorientable unit clauses: 0
% 0.15/0.48 % Negative unit clauses : 6
% 0.15/0.48 % Non-unit-clauses : 102
% 0.15/0.48 % Current number of unprocessed clauses: 420
% 0.15/0.48 % ...number of literals in the above : 2284
% 0.15/0.48 % Current number of archived formulas : 0
% 0.15/0.48 % Current number of archived clauses : 18
% 0.15/0.48 % Clause-clause subsumption calls (NU) : 3559
% 0.15/0.48 % Rec. Clause-clause subsumption calls : 1505
% 0.15/0.48 % Non-unit clause-clause subsumptions : 92
% 0.15/0.48 % Unit Clause-clause subsumption calls : 125
% 0.15/0.48 % Rewrite failures with RHS unbound : 0
% 0.15/0.48 % BW rewrite match attempts : 5
% 0.15/0.48 % BW rewrite match successes : 5
% 0.15/0.48 % Condensation attempts : 0
% 0.15/0.48 % Condensation successes : 0
% 0.15/0.48 % Termbank termtop insertions : 12934
% 0.15/0.48 % Search garbage collected termcells : 588
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.032 s
% 0.15/0.48 % System time : 0.006 s
% 0.15/0.48 % Total time : 0.038 s
% 0.15/0.48 % Maximum resident set size: 3664 pages
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.115 s
% 0.15/0.48 % System time : 0.019 s
% 0.15/0.48 % Total time : 0.135 s
% 0.15/0.48 % Maximum resident set size: 4864 pages
% 0.15/0.48 % E exiting
%------------------------------------------------------------------------------