%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET031-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:16:10 PM UTC 2026
% Result : Unsatisfiable 7.65s 1.46s
% Output : CNFRefutation 7.65s
% 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/sandbox2/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/sandbox2/benchmark/Axioms/SET003-0.ax',compose4) ).
cnf(compose1,axiom,
( ~ member(X1,compose(X2,X3))
| little_set(f29(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',compose1) ).
cnf(compose2,axiom,
( ~ member(X1,compose(X2,X3))
| little_set(f30(X1,X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',compose2) ).
cnf(relation3,axiom,
( ~ ordered_pair_predicate(f18(X1))
| relation(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET003-0.ax',relation3) ).
cnf(prove_composition_is_a_relation,negated_conjecture,
~ relation(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_composition_is_a_relation) ).
cnf(relation2,axiom,
( member(f18(X1),X1)
| relation(X1) ),
file('/export/starexec/sandbox2/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.02 % Problem : SET031-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n003.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % 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:46:46 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 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
% 7.65/1.46 % Version: 3.5.1
% 7.65/1.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.65/1.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.65/1.46 % Starting new_bool_3 with 300s (1) cores
% 7.65/1.46 % Starting new_bool_1 with 300s (1) cores
% 7.65/1.46 % Starting sh5l with 300s (1) cores
% 7.65/1.46 % sh5l with pid 3435769 completed with status 0
% 7.65/1.46 % Result found by sh5l
% 7.65/1.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.65/1.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.65/1.46 % Starting new_bool_3 with 300s (1) cores
% 7.65/1.46 % Starting new_bool_1 with 300s (1) cores
% 7.65/1.46 % Starting sh5l with 300s (1) cores
% 7.65/1.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 7.65/1.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 7.65/1.46 % Search class: FGHSF-FFMF31-MFFFFFNN
% 7.65/1.46 % partial match(1): FGHSF-FFMF31-SFFFFFNN
% 7.65/1.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 7.65/1.46 % Starting SubtermCWHack with 28s (1) cores
% 7.65/1.46 % SubtermCWHack with pid 3435774 completed with status 0
% 7.65/1.46 % Result found by SubtermCWHack
% 7.65/1.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.65/1.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.65/1.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.65/1.46 % Starting new_bool_3 with 300s (1) cores
% 7.65/1.46 % Starting new_bool_1 with 300s (1) cores
% 7.65/1.46 % Starting sh5l with 300s (1) cores
% 7.65/1.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 7.65/1.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 7.65/1.46 % Search class: FGHSF-FFMF31-MFFFFFNN
% 7.65/1.46 % partial match(1): FGHSF-FFMF31-SFFFFFNN
% 7.65/1.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 7.65/1.46 % Starting SubtermCWHack with 28s (1) cores
% 7.65/1.46 % Preprocessing time : 0.003 s
% 7.65/1.46
% 7.65/1.46 % Proof found!
% 7.65/1.46 % SZS status Unsatisfiable
% 7.65/1.46 % SZS output start CNFRefutation
% See solution above
% 7.65/1.46 % Parsed axioms : 142
% 7.65/1.46 % Removed by relevancy pruning/SinE : 44
% 7.65/1.46 % Initial clauses : 98
% 7.65/1.46 % Removed in clause preprocessing : 0
% 7.65/1.46 % Initial clauses in saturation : 98
% 7.65/1.46 % Processed clauses : 2907
% 7.65/1.46 % ...of these trivial : 12
% 7.65/1.46 % ...subsumed : 1665
% 7.65/1.46 % ...remaining for further processing : 1230
% 7.65/1.46 % Other redundant clauses eliminated : 12
% 7.65/1.46 % Clauses deleted for lack of memory : 0
% 7.65/1.46 % Backward-subsumed : 5
% 7.65/1.46 % Backward-rewritten : 42
% 7.65/1.46 % Generated clauses : 43174
% 7.65/1.46 % ...of the previous two non-redundant : 23072
% 7.65/1.46 % ...aggressively subsumed : 0
% 7.65/1.46 % Contextual simplify-reflections : 39
% 7.65/1.46 % Paramodulations : 43162
% 7.65/1.46 % Factorizations : 0
% 7.65/1.46 % NegExts : 0
% 7.65/1.46 % Equation resolutions : 12
% 7.65/1.46 % Disequality decompositions : 0
% 7.65/1.46 % Total rewrite steps : 67725
% 7.65/1.46 % ...of those cached : 67566
% 7.65/1.46 % Propositional unsat checks : 0
% 7.65/1.46 % Propositional check models : 0
% 7.65/1.46 % Propositional check unsatisfiable : 0
% 7.65/1.46 % Propositional clauses : 0
% 7.65/1.46 % Propositional clauses after purity: 0
% 7.65/1.46 % Propositional unsat core size : 0
% 7.65/1.46 % Propositional preprocessing time : 0.000
% 7.65/1.46 % Propositional encoding time : 0.000
% 7.65/1.46 % Propositional solver time : 0.000
% 7.65/1.46 % Success case prop preproc time : 0.000
% 7.65/1.46 % Success case prop encoding time : 0.000
% 7.65/1.46 % Success case prop solver time : 0.000
% 7.65/1.46 % Current number of processed clauses : 1171
% 7.65/1.46 % Positive orientable unit clauses : 29
% 7.65/1.46 % Positive unorientable unit clauses: 0
% 7.65/1.46 % Negative unit clauses : 3
% 7.65/1.46 % Non-unit-clauses : 1139
% 7.65/1.46 % Current number of unprocessed clauses: 20147
% 7.65/1.46 % ...number of literals in the above : 59341
% 7.65/1.46 % Current number of archived formulas : 0
% 7.65/1.46 % Current number of archived clauses : 47
% 7.65/1.46 % Clause-clause subsumption calls (NU) : 298792
% 7.65/1.46 % Rec. Clause-clause subsumption calls : 209424
% 7.65/1.46 % Non-unit clause-clause subsumptions : 334
% 7.65/1.46 % Unit Clause-clause subsumption calls : 4271
% 7.65/1.46 % Rewrite failures with RHS unbound : 0
% 7.65/1.46 % BW rewrite match attempts : 31
% 7.65/1.46 % BW rewrite match successes : 27
% 7.65/1.46 % Condensation attempts : 0
% 7.65/1.46 % Condensation successes : 0
% 7.65/1.46 % Termbank termtop insertions : 630226
% 7.65/1.46 % Search garbage collected termcells : 425
% 7.65/1.46
% 7.65/1.46 % -------------------------------------------------
% 7.65/1.46 % User time : 0.785 s
% 7.65/1.46 % System time : 0.033 s
% 7.65/1.46 % Total time : 0.819 s
% 7.65/1.46 % Maximum resident set size: 4024 pages
% 7.65/1.46
% 7.65/1.46 % -------------------------------------------------
% 7.65/1.46 % User time : 0.790 s
% 7.65/1.46 % System time : 0.034 s
% 7.65/1.46 % Total time : 0.825 s
% 7.65/1.46 % Maximum resident set size: 4864 pages
% 7.65/1.46 % E exiting
%------------------------------------------------------------------------------