%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL123-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 12:09:42 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 5 unt; 0 nHn; 31 RR)
% Number of literals : 71 ( 0 equ; 45 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Transitive__Closure_Ortrancl__trans_0,axiom,
( ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl__trans_0) ).
cnf(cls_conjecture_3,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Transitive__Closure_Or__into__rtrancl_0,axiom,
( ~ c_in(X1,X2,tc_prod(X3,X3))
| c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Transitive__Closure_Or__into__rtrancl_0) ).
cnf(cls_conjecture_6,negated_conjecture,
( ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_7,negated_conjecture,
( ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_9,plain,
( ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Ortrancl__trans_0]) ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_11,plain,
( ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ c_in(X1,X2,tc_prod(X3,X3))
| c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Or__into__rtrancl_0]) ).
cnf(c_0_14,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xaa(X1),X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| c_in(c_Pair(X1,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ c_in(X1,X2,tc_prod(X3,X3))
| c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3)) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
( ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xaa(X1),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
( ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,v_xaa(X1),X3),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_2 ).
cnf(c_0_23,negated_conjecture,
( ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_7]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X1,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,v_xa(X1,v_xaa(v_xb),X2),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_27,negated_conjecture,
( ~ c_in(c_Pair(X1,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X1,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_1 ).
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_27,c_0_28]),c_0_29]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL123-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n011.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 14:12:27 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.42 Running first-order theorem proving
% 0.15/0.42 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
% 0.18/0.52 % Version: 3.5.1
% 0.18/0.52 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.18/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 % Starting sh5l with 300s (1) cores
% 0.18/0.52 % new_bool_3 with pid 2120647 completed with status 0
% 0.18/0.52 % Result found by new_bool_3
% 0.18/0.52 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.18/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.18/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.52 % SubtermCWHack with pid 2120650 completed with status 0
% 0.18/0.52 % Result found by SubtermCWHack
% 0.18/0.52 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.18/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.18/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.52 % Preprocessing time : 0.002 s
% 0.18/0.52
% 0.18/0.52 % Proof found!
% 0.18/0.52 % SZS status Unsatisfiable
% 0.18/0.52 % SZS output start CNFRefutation
% See solution above
% 0.18/0.52 % Parsed axioms : 1374
% 0.18/0.52 % Removed by relevancy pruning/SinE : 1330
% 0.18/0.52 % Initial clauses : 44
% 0.18/0.52 % Removed in clause preprocessing : 0
% 0.18/0.52 % Initial clauses in saturation : 44
% 0.18/0.52 % Processed clauses : 577
% 0.18/0.52 % ...of these trivial : 6
% 0.18/0.52 % ...subsumed : 288
% 0.18/0.52 % ...remaining for further processing : 283
% 0.18/0.52 % Other redundant clauses eliminated : 0
% 0.18/0.52 % Clauses deleted for lack of memory : 0
% 0.18/0.52 % Backward-subsumed : 9
% 0.18/0.52 % Backward-rewritten : 2
% 0.18/0.52 % Generated clauses : 2598
% 0.18/0.52 % ...of the previous two non-redundant : 2543
% 0.18/0.52 % ...aggressively subsumed : 0
% 0.18/0.52 % Contextual simplify-reflections : 0
% 0.18/0.52 % Paramodulations : 2592
% 0.18/0.52 % Factorizations : 0
% 0.18/0.52 % NegExts : 0
% 0.18/0.52 % Equation resolutions : 6
% 0.18/0.52 % Disequality decompositions : 0
% 0.18/0.52 % Total rewrite steps : 59
% 0.18/0.52 % ...of those cached : 45
% 0.18/0.52 % Propositional unsat checks : 0
% 0.18/0.52 % Propositional check models : 0
% 0.18/0.52 % Propositional check unsatisfiable : 0
% 0.18/0.52 % Propositional clauses : 0
% 0.18/0.52 % Propositional clauses after purity: 0
% 0.18/0.52 % Propositional unsat core size : 0
% 0.18/0.52 % Propositional preprocessing time : 0.000
% 0.18/0.52 % Propositional encoding time : 0.000
% 0.18/0.52 % Propositional solver time : 0.000
% 0.18/0.52 % Success case prop preproc time : 0.000
% 0.18/0.52 % Success case prop encoding time : 0.000
% 0.18/0.52 % Success case prop solver time : 0.000
% 0.18/0.52 % Current number of processed clauses : 272
% 0.18/0.52 % Positive orientable unit clauses : 11
% 0.18/0.52 % Positive unorientable unit clauses: 0
% 0.18/0.52 % Negative unit clauses : 6
% 0.18/0.52 % Non-unit-clauses : 255
% 0.18/0.52 % Current number of unprocessed clauses: 2008
% 0.18/0.52 % ...number of literals in the above : 8050
% 0.18/0.52 % Current number of archived formulas : 0
% 0.18/0.52 % Current number of archived clauses : 11
% 0.18/0.52 % Clause-clause subsumption calls (NU) : 36617
% 0.18/0.52 % Rec. Clause-clause subsumption calls : 31586
% 0.18/0.52 % Non-unit clause-clause subsumptions : 290
% 0.18/0.52 % Unit Clause-clause subsumption calls : 19
% 0.18/0.52 % Rewrite failures with RHS unbound : 0
% 0.18/0.52 % BW rewrite match attempts : 5
% 0.18/0.52 % BW rewrite match successes : 2
% 0.18/0.52 % Condensation attempts : 0
% 0.18/0.52 % Condensation successes : 0
% 0.18/0.52 % Termbank termtop insertions : 101207
% 0.18/0.52 % Search garbage collected termcells : 2637
% 0.18/0.52
% 0.18/0.52 % -------------------------------------------------
% 0.18/0.52 % User time : 0.051 s
% 0.18/0.52 % System time : 0.007 s
% 0.18/0.52 % Total time : 0.058 s
% 0.18/0.52 % Maximum resident set size: 4616 pages
% 0.18/0.52
% 0.18/0.52 % -------------------------------------------------
% 0.18/0.52 % User time : 0.070 s
% 0.18/0.52 % System time : 0.015 s
% 0.18/0.52 % Total time : 0.085 s
% 0.18/0.52 % Maximum resident set size: 5376 pages
% 0.18/0.52 % E exiting
%------------------------------------------------------------------------------