%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU030+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 : 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:23:42 PM UTC 2026
% Result : Theorem 0.22s 0.62s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 136 ( 42 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 172 ( 67 ~; 61 |; 29 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_funct_1,conjecture,
! [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(l72_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ! [X4] :
( ( function(X4)
& relation(X4) )
=> ( ( relation_composition(X3,X4) = identity_relation(X1)
& relation_composition(X2,X3) = identity_relation(relation_dom(X4))
& relation_rng(X2) = X1 )
=> X4 = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l72_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(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(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(c_0_5,negated_conjecture,
~ ! [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) ) ) ),
inference(assume_negation,[status(cth)],[t63_funct_1]) ).
fof(c_0_6,plain,
! [X28,X29,X30,X31] :
( X31 = X29
| relation_composition(X30,X31) != identity_relation(X28)
| relation_composition(X29,X30) != identity_relation(relation_dom(X31))
| relation_rng(X29) != X28
| ~ function(X31)
| ~ relation(X31)
| ~ function(X30)
| ~ relation(X30)
| ~ function(X29)
| ~ relation(X29) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l72_funct_1])])])]) ).
fof(c_0_7,plain,
! [X58] :
( ( ~ function(X58)
| ~ relation(X58)
| ~ one_to_one(X58)
| relation_composition(function_inverse(X58),X58) = identity_relation(relation_rng(X58)) )
& ( ~ function(X58)
| ~ relation(X58)
| ~ one_to_one(X58)
| relation_composition(X58,function_inverse(X58)) = identity_relation(relation_dom(X58)) ) ),
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,negated_conjecture,
( esk13_0 != function_inverse(esk12_0)
& relation_composition(esk12_0,esk13_0) = identity_relation(relation_dom(esk12_0))
& relation_rng(esk12_0) = relation_dom(esk13_0)
& one_to_one(esk12_0)
& function(esk13_0)
& relation(esk13_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_5])])])]) ).
cnf(c_0_9,plain,
( relation_composition(X2,X3) != identity_relation(X4)
| relation_composition(X1,X2) != identity_relation(relation_dom(X3))
| relation_rng(X1) != X4
| ~ function(X3)
| ~ relation(X3)
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,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_11,negated_conjecture,
relation_rng(esk12_0) = relation_dom(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
one_to_one(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
relation(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
function(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ function(X1)
| ~ function(X3)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X3)
| ~ relation(X2)
| relation_composition(X3,X2) != identity_relation(relation_rng(X1))
| relation_composition(X1,X3) != identity_relation(relation_dom(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
identity_relation(relation_dom(esk13_0)) = relation_composition(function_inverse(esk12_0),esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
relation(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
function(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2)
| relation_composition(X2,esk13_0) != identity_relation(relation_rng(X1))
| relation_composition(X1,X2) != relation_composition(function_inverse(esk12_0),esk12_0)
| X1 = esk13_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_20,negated_conjecture,
esk13_0 != function_inverse(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_21,plain,
! [X54] :
( ( ~ function(X54)
| ~ relation(X54)
| ~ one_to_one(X54)
| relation_dom(X54) = relation_rng(function_inverse(X54)) )
& ( ~ function(X54)
| ~ relation(X54)
| ~ one_to_one(X54)
| relation_rng(X54) = relation_dom(function_inverse(X54)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_funct_1])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ function(function_inverse(esk12_0))
| ~ relation(function_inverse(esk12_0))
| identity_relation(relation_rng(function_inverse(esk12_0))) != relation_composition(esk12_0,esk13_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_13]),c_0_14])]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| relation_dom(X1) = relation_rng(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
relation_composition(esk12_0,esk13_0) = identity_relation(relation_dom(esk12_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_25,plain,
! [X10] :
( ( ~ function(X10)
| ~ relation(X10)
| function(function_inverse(X10)) )
& ( ~ function(X10)
| ~ relation(X10)
| relation(function_inverse(X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ function(function_inverse(esk12_0))
| ~ relation(function_inverse(esk12_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_22,c_0_23]),c_0_24]),c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_27,plain,
( ~ function(X1)
| ~ relation(X1)
| function(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ relation(function_inverse(esk12_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_13]),c_0_14])]) ).
cnf(c_0_29,plain,
( ~ function(X1)
| ~ relation(X1)
| relation(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU030+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n010.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 05:47:41 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.53 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.22/0.62 % Version: 3.5.1
% 0.22/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.62 % Starting sh5l with 300s (1) cores
% 0.22/0.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 150363 completed with status 0
% 0.22/0.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.62 % No SInE strategy applied
% 0.22/0.62 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.22/0.62 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.22/0.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 150370 completed with status 0
% 0.22/0.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.62 % No SInE strategy applied
% 0.22/0.62 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.62 % Preprocessing time : 0.003 s
% 0.22/0.62 % Presaturation interreduction done
% 0.22/0.62
% 0.22/0.62 % Proof found!
% 0.22/0.62 % SZS status Theorem
% 0.22/0.62 % SZS output start CNFRefutation
% See solution above
% 0.22/0.62 % Parsed axioms : 43
% 0.22/0.62 % Removed by relevancy pruning/SinE : 0
% 0.22/0.62 % Initial clauses : 75
% 0.22/0.62 % Removed in clause preprocessing : 2
% 0.22/0.62 % Initial clauses in saturation : 73
% 0.22/0.62 % Processed clauses : 554
% 0.22/0.62 % ...of these trivial : 5
% 0.22/0.62 % ...subsumed : 223
% 0.22/0.62 % ...remaining for further processing : 326
% 0.22/0.62 % Other redundant clauses eliminated : 1
% 0.22/0.62 % Clauses deleted for lack of memory : 0
% 0.22/0.62 % Backward-subsumed : 23
% 0.22/0.62 % Backward-rewritten : 19
% 0.22/0.62 % Generated clauses : 1625
% 0.22/0.62 % ...of the previous two non-redundant : 1149
% 0.22/0.62 % ...aggressively subsumed : 0
% 0.22/0.62 % Contextual simplify-reflections : 21
% 0.22/0.62 % Paramodulations : 1623
% 0.22/0.62 % Factorizations : 0
% 0.22/0.62 % NegExts : 0
% 0.22/0.62 % Equation resolutions : 2
% 0.22/0.62 % Disequality decompositions : 0
% 0.22/0.62 % Total rewrite steps : 1144
% 0.22/0.62 % ...of those cached : 1100
% 0.22/0.62 % Propositional unsat checks : 0
% 0.22/0.62 % Propositional check models : 0
% 0.22/0.62 % Propositional check unsatisfiable : 0
% 0.22/0.62 % Propositional clauses : 0
% 0.22/0.62 % Propositional clauses after purity: 0
% 0.22/0.62 % Propositional unsat core size : 0
% 0.22/0.62 % Propositional preprocessing time : 0.000
% 0.22/0.62 % Propositional encoding time : 0.000
% 0.22/0.62 % Propositional solver time : 0.000
% 0.22/0.62 % Success case prop preproc time : 0.000
% 0.22/0.62 % Success case prop encoding time : 0.000
% 0.22/0.62 % Success case prop solver time : 0.000
% 0.22/0.62 % Current number of processed clauses : 215
% 0.22/0.62 % Positive orientable unit clauses : 38
% 0.22/0.62 % Positive unorientable unit clauses: 0
% 0.22/0.62 % Negative unit clauses : 7
% 0.22/0.62 % Non-unit-clauses : 170
% 0.22/0.62 % Current number of unprocessed clauses: 688
% 0.22/0.62 % ...number of literals in the above : 3271
% 0.22/0.62 % Current number of archived formulas : 0
% 0.22/0.62 % Current number of archived clauses : 110
% 0.22/0.62 % Clause-clause subsumption calls (NU) : 8552
% 0.22/0.62 % Rec. Clause-clause subsumption calls : 6503
% 0.22/0.62 % Non-unit clause-clause subsumptions : 256
% 0.22/0.62 % Unit Clause-clause subsumption calls : 240
% 0.22/0.62 % Rewrite failures with RHS unbound : 0
% 0.22/0.62 % BW rewrite match attempts : 6
% 0.22/0.62 % BW rewrite match successes : 6
% 0.22/0.62 % Condensation attempts : 0
% 0.22/0.62 % Condensation successes : 0
% 0.22/0.62 % Termbank termtop insertions : 23524
% 0.22/0.62 % Search garbage collected termcells : 651
% 0.22/0.62
% 0.22/0.62 % -------------------------------------------------
% 0.22/0.62 % User time : 0.066 s
% 0.22/0.62 % System time : 0.007 s
% 0.22/0.62 % Total time : 0.073 s
% 0.22/0.62 % Maximum resident set size: 3668 pages
% 0.22/0.62
% 0.22/0.62 % -------------------------------------------------
% 0.22/0.62 % User time : 0.306 s
% 0.22/0.62 % System time : 0.033 s
% 0.22/0.62 % Total time : 0.339 s
% 0.22/0.62 % Maximum resident set size: 4864 pages
% 0.22/0.62 % E exiting
%------------------------------------------------------------------------------