%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL014+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:03:54 PM UTC 2026
% Result : Theorem 0.15s 5.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 15 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(goals,conjecture,
! [X1] :
( composition(one,X1) = X1
& composition(X1,one) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_4,plain,
! [X11,X12] : converse(composition(X11,X12)) = composition(converse(X12),converse(X11)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_5,plain,
! [X21] : converse(converse(X21)) = X21,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_6,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X15] : composition(X15,one) = X15,
inference(variable_rename,[status(thm)],[composition_identity]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( composition(one,X1) = X1
& composition(X1,one) = X1 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_10,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( composition(one,esk1_0) != esk1_0
| composition(esk1_0,one) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_13,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( composition(one,esk1_0) != esk1_0
| composition(esk1_0,one) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
composition(one,esk1_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11])]) ).
cnf(c_0_17,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL014+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n016.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 04:04:00 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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/5.44 % Version: 3.5.1
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44 % Starting sh5l with 300s (1) cores
% 0.15/5.44 % new_bool_3 with pid 1511353 completed with status 0
% 0.15/5.44 % Result found by new_bool_3
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.44 % SubtermCWHack with pid 1511357 completed with status 0
% 0.15/5.44 % Result found by SubtermCWHack
% 0.15/5.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.15/5.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.44 % Preprocessing time : 0.001 s
% 0.15/5.44
% 0.15/5.44 % Proof found!
% 0.15/5.44 % SZS status Theorem
% 0.15/5.44 % SZS output start CNFRefutation
% See solution above
% 0.15/5.44 % Parsed axioms : 14
% 0.15/5.44 % Removed by relevancy pruning/SinE : 3
% 0.15/5.44 % Initial clauses : 11
% 0.15/5.44 % Removed in clause preprocessing : 0
% 0.15/5.44 % Initial clauses in saturation : 11
% 0.15/5.44 % Processed clauses : 17
% 0.15/5.44 % ...of these trivial : 0
% 0.15/5.44 % ...subsumed : 4
% 0.15/5.44 % ...remaining for further processing : 13
% 0.15/5.44 % Other redundant clauses eliminated : 0
% 0.15/5.44 % Clauses deleted for lack of memory : 0
% 0.15/5.44 % Backward-subsumed : 0
% 0.15/5.44 % Backward-rewritten : 2
% 0.15/5.44 % Generated clauses : 60
% 0.15/5.44 % ...of the previous two non-redundant : 48
% 0.15/5.44 % ...aggressively subsumed : 0
% 0.15/5.44 % Contextual simplify-reflections : 0
% 0.15/5.44 % Paramodulations : 60
% 0.15/5.44 % Factorizations : 0
% 0.15/5.44 % NegExts : 0
% 0.15/5.44 % Equation resolutions : 0
% 0.15/5.44 % Disequality decompositions : 0
% 0.15/5.44 % Total rewrite steps : 32
% 0.15/5.44 % ...of those cached : 13
% 0.15/5.44 % Propositional unsat checks : 0
% 0.15/5.44 % Propositional check models : 0
% 0.15/5.44 % Propositional check unsatisfiable : 0
% 0.15/5.44 % Propositional clauses : 0
% 0.15/5.44 % Propositional clauses after purity: 0
% 0.15/5.44 % Propositional unsat core size : 0
% 0.15/5.44 % Propositional preprocessing time : 0.000
% 0.15/5.44 % Propositional encoding time : 0.000
% 0.15/5.44 % Propositional solver time : 0.000
% 0.15/5.44 % Success case prop preproc time : 0.000
% 0.15/5.44 % Success case prop encoding time : 0.000
% 0.15/5.44 % Success case prop solver time : 0.000
% 0.15/5.44 % Current number of processed clauses : 11
% 0.15/5.44 % Positive orientable unit clauses : 10
% 0.15/5.44 % Positive unorientable unit clauses: 1
% 0.15/5.44 % Negative unit clauses : 0
% 0.15/5.44 % Non-unit-clauses : 0
% 0.15/5.44 % Current number of unprocessed clauses: 42
% 0.15/5.44 % ...number of literals in the above : 42
% 0.15/5.44 % Current number of archived formulas : 0
% 0.15/5.44 % Current number of archived clauses : 2
% 0.15/5.44 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.44 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.44 % Non-unit clause-clause subsumptions : 0
% 0.15/5.44 % Unit Clause-clause subsumption calls : 0
% 0.15/5.44 % Rewrite failures with RHS unbound : 0
% 0.15/5.44 % BW rewrite match attempts : 2
% 0.15/5.44 % BW rewrite match successes : 2
% 0.15/5.44 % Condensation attempts : 0
% 0.15/5.44 % Condensation successes : 0
% 0.15/5.44 % Termbank termtop insertions : 988
% 0.15/5.44 % Search garbage collected termcells : 32
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.006 s
% 0.15/5.44 % System time : 0.000 s
% 0.15/5.44 % Total time : 0.006 s
% 0.15/5.44 % Maximum resident set size: 3648 pages
% 0.15/5.44
% 0.15/5.44 % -------------------------------------------------
% 0.15/5.44 % User time : 0.006 s
% 0.15/5.44 % System time : 0.006 s
% 0.15/5.44 % Total time : 0.013 s
% 0.15/5.44 % Maximum resident set size: 4864 pages
% 0.15/5.44 % E exiting
%------------------------------------------------------------------------------