%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET031-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:13:12 PM UTC 2026
% Result : Unsatisfiable 7.39s 1.52s
% Output : CNFRefutation 7.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 5 unt; 2 nHn; 21 RR)
% Number of literals : 50 ( 6 equ; 27 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 48 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ordered_pair_predicate4,axiom,
( X1 != ordered_pair(X2,X3)
| ~ little_set(X3)
| ~ little_set(X2)
| ordered_pair_predicate(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate4) ).
cnf(compose4,axiom,
( ~ member(X1,compose(X2,X3))
| X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose4) ).
cnf(compose1,axiom,
( ~ member(X1,compose(X2,X3))
| little_set(f29(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose1) ).
cnf(compose2,axiom,
( ~ member(X1,compose(X2,X3))
| little_set(f30(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose2) ).
cnf(relation3,axiom,
( ~ ordered_pair_predicate(f18(X1))
| relation(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',relation3) ).
cnf(prove_composition_is_a_relation,negated_conjecture,
~ relation(compose(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_composition_is_a_relation) ).
cnf(relation2,axiom,
( member(f18(X1),X1)
| relation(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',relation2) ).
cnf(c_0_7,plain,
( X1 != ordered_pair(X2,X3)
| ~ little_set(X3)
| ~ little_set(X2)
| ordered_pair_predicate(X1) ),
inference(fof_simplification,[status(thm)],[ordered_pair_predicate4]) ).
cnf(c_0_8,plain,
( X1 != ordered_pair(X2,X3)
| ~ little_set(X3)
| ~ little_set(X2)
| ordered_pair_predicate(X1) ),
c_0_7 ).
cnf(c_0_9,plain,
( ~ member(X1,compose(X2,X3))
| X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[compose4]) ).
cnf(c_0_10,plain,
( ~ member(X1,compose(X2,X3))
| little_set(f29(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[compose1]) ).
cnf(c_0_11,plain,
( ~ member(X1,compose(X2,X3))
| little_set(f30(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[compose2]) ).
cnf(c_0_12,plain,
( ~ little_set(X1)
| ~ little_set(X2)
| ordered_pair_predicate(ordered_pair(X1,X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ member(X1,compose(X2,X3))
| X1 = ordered_pair(f29(X1,X2,X3),f30(X1,X2,X3)) ),
c_0_9 ).
cnf(c_0_14,plain,
( ~ member(X1,compose(X2,X3))
| little_set(f29(X1,X2,X3)) ),
c_0_10 ).
cnf(c_0_15,plain,
( ~ member(X1,compose(X2,X3))
| little_set(f30(X1,X2,X3)) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ ordered_pair_predicate(f18(X1))
| relation(X1) ),
inference(fof_simplification,[status(thm)],[relation3]) ).
cnf(c_0_17,negated_conjecture,
~ relation(compose(a,b)),
inference(fof_simplification,[status(thm)],[prove_composition_is_a_relation]) ).
cnf(c_0_18,plain,
( ~ member(X1,compose(X2,X3))
| ordered_pair_predicate(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).
cnf(c_0_19,axiom,
( member(f18(X1),X1)
| relation(X1) ),
relation2 ).
cnf(c_0_20,plain,
( ~ ordered_pair_predicate(f18(X1))
| relation(X1) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
~ relation(compose(a,b)),
c_0_17 ).
cnf(c_0_22,plain,
relation(compose(X1,X2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET031-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:45:03 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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
% 7.39/1.52 % Version: 3.5.1
% 7.39/1.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.39/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.39/1.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.39/1.52 % Starting new_bool_3 with 300s (1) cores
% 7.39/1.52 % Starting new_bool_1 with 300s (1) cores
% 7.39/1.52 % Starting sh5l with 300s (1) cores
% 7.39/1.52 % sh5l with pid 2579570 completed with status 0
% 7.39/1.52 % Result found by sh5l
% 7.39/1.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.39/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.39/1.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.39/1.52 % Starting new_bool_3 with 300s (1) cores
% 7.39/1.52 % Starting new_bool_1 with 300s (1) cores
% 7.39/1.52 % Starting sh5l with 300s (1) cores
% 7.39/1.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 7.39/1.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 7.39/1.52 % Search class: FGHSM-FFMF31-MFFFFFNN
% 7.39/1.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 7.39/1.52 % Starting SubtermCWHack with 31s (1) cores
% 7.39/1.52 % SubtermCWHack with pid 2579571 completed with status 0
% 7.39/1.52 % Result found by SubtermCWHack
% 7.39/1.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.39/1.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.39/1.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.39/1.52 % Starting new_bool_3 with 300s (1) cores
% 7.39/1.52 % Starting new_bool_1 with 300s (1) cores
% 7.39/1.52 % Starting sh5l with 300s (1) cores
% 7.39/1.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 7.39/1.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 7.39/1.52 % Search class: FGHSM-FFMF31-MFFFFFNN
% 7.39/1.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 7.39/1.52 % Starting SubtermCWHack with 31s (1) cores
% 7.39/1.52 % Preprocessing time : 0.003 s
% 7.39/1.52
% 7.39/1.52 % Proof found!
% 7.39/1.52 % SZS status Unsatisfiable
% 7.39/1.52 % SZS output start CNFRefutation
% See solution above
% 7.39/1.52 % Parsed axioms : 157
% 7.39/1.52 % Removed by relevancy pruning/SinE : 40
% 7.39/1.52 % Initial clauses : 117
% 7.39/1.52 % Removed in clause preprocessing : 0
% 7.39/1.52 % Initial clauses in saturation : 117
% 7.39/1.52 % Processed clauses : 5243
% 7.39/1.52 % ...of these trivial : 65
% 7.39/1.52 % ...subsumed : 2199
% 7.39/1.52 % ...remaining for further processing : 2979
% 7.39/1.52 % Other redundant clauses eliminated : 124
% 7.39/1.52 % Clauses deleted for lack of memory : 0
% 7.39/1.52 % Backward-subsumed : 8
% 7.39/1.52 % Backward-rewritten : 28
% 7.39/1.52 % Generated clauses : 61205
% 7.39/1.52 % ...of the previous two non-redundant : 57759
% 7.39/1.52 % ...aggressively subsumed : 0
% 7.39/1.52 % Contextual simplify-reflections : 48
% 7.39/1.52 % Paramodulations : 61072
% 7.39/1.52 % Factorizations : 6
% 7.39/1.52 % NegExts : 0
% 7.39/1.52 % Equation resolutions : 127
% 7.39/1.52 % Disequality decompositions : 0
% 7.39/1.52 % Total rewrite steps : 6010
% 7.39/1.52 % ...of those cached : 5482
% 7.39/1.52 % Propositional unsat checks : 0
% 7.39/1.52 % Propositional check models : 0
% 7.39/1.52 % Propositional check unsatisfiable : 0
% 7.39/1.52 % Propositional clauses : 0
% 7.39/1.52 % Propositional clauses after purity: 0
% 7.39/1.52 % Propositional unsat core size : 0
% 7.39/1.52 % Propositional preprocessing time : 0.000
% 7.39/1.52 % Propositional encoding time : 0.000
% 7.39/1.52 % Propositional solver time : 0.000
% 7.39/1.52 % Success case prop preproc time : 0.000
% 7.39/1.52 % Success case prop encoding time : 0.000
% 7.39/1.52 % Success case prop solver time : 0.000
% 7.39/1.52 % Current number of processed clauses : 2929
% 7.39/1.52 % Positive orientable unit clauses : 86
% 7.39/1.52 % Positive unorientable unit clauses: 2
% 7.39/1.52 % Negative unit clauses : 2
% 7.39/1.52 % Non-unit-clauses : 2839
% 7.39/1.52 % Current number of unprocessed clauses: 52613
% 7.39/1.52 % ...number of literals in the above : 150168
% 7.39/1.52 % Current number of archived formulas : 0
% 7.39/1.52 % Current number of archived clauses : 36
% 7.39/1.52 % Clause-clause subsumption calls (NU) : 1633863
% 7.39/1.52 % Rec. Clause-clause subsumption calls : 1124849
% 7.39/1.52 % Non-unit clause-clause subsumptions : 2208
% 7.39/1.52 % Unit Clause-clause subsumption calls : 4131
% 7.39/1.52 % Rewrite failures with RHS unbound : 0
% 7.39/1.52 % BW rewrite match attempts : 53
% 7.39/1.52 % BW rewrite match successes : 18
% 7.39/1.52 % Condensation attempts : 0
% 7.39/1.52 % Condensation successes : 0
% 7.39/1.52 % Termbank termtop insertions : 807804
% 7.39/1.52 % Search garbage collected termcells : 447
% 7.39/1.52
% 7.39/1.52 % -------------------------------------------------
% 7.39/1.52 % User time : 1.004 s
% 7.39/1.52 % System time : 0.049 s
% 7.39/1.52 % Total time : 1.053 s
% 7.39/1.52 % Maximum resident set size: 4028 pages
% 7.39/1.52
% 7.39/1.52 % -------------------------------------------------
% 7.39/1.52 % User time : 1.006 s
% 7.39/1.52 % System time : 0.056 s
% 7.39/1.52 % Total time : 1.062 s
% 7.39/1.52 % Maximum resident set size: 4864 pages
% 7.39/1.52 % E exiting
%------------------------------------------------------------------------------