%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL102-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 : n017.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:37 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 17 RR)
% Number of literals : 33 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 34 ( 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(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
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_Comb_Ocontract_OAp1_0,axiom,
( ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X1,X3),c_Comb_Ocomb_Oop_A_D_D(X2,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/COL002-0.ax',cls_Comb_Ocontract_OAp1_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Pair(v_y,v_za,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_6,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_7,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_8,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_6 ).
cnf(c_0_9,negated_conjecture,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_2 ).
cnf(c_0_10,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,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_13,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,tc_prod(X3,X3))
| c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3)) ),
c_0_12 ).
cnf(c_0_15,plain,
( ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X1,X3),c_Comb_Ocomb_Oop_A_D_D(X2,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_Comb_Ocontract_OAp1_0]) ).
cnf(c_0_16,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_y,v_z),c_Comb_Ocomb_Oop_A_D_D(v_za,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X1,X3),c_Comb_Ocomb_Oop_A_D_D(X2,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
c_in(c_Pair(v_y,v_za,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_1 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL102-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.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 14:06:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_3 with pid 2513222 completed with status 0
% 0.14/0.45 % Result found by new_bool_3
% 0.14/0.45 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.14/0.45 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 2513225 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.14/0.45 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.003 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Unsatisfiable
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 1387
% 0.14/0.45 % Removed by relevancy pruning/SinE : 1339
% 0.14/0.45 % Initial clauses : 48
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 48
% 0.14/0.45 % Processed clauses : 70
% 0.14/0.45 % ...of these trivial : 4
% 0.14/0.45 % ...subsumed : 11
% 0.14/0.45 % ...remaining for further processing : 55
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 1
% 0.14/0.45 % Backward-rewritten : 2
% 0.14/0.45 % Generated clauses : 51
% 0.14/0.45 % ...of the previous two non-redundant : 29
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 43
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 8
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 6
% 0.14/0.45 % ...of those cached : 1
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 52
% 0.14/0.45 % Positive orientable unit clauses : 12
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 9
% 0.14/0.45 % Non-unit-clauses : 31
% 0.14/0.45 % Current number of unprocessed clauses: 7
% 0.14/0.45 % ...number of literals in the above : 21
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 3
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 201
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 201
% 0.14/0.45 % Non-unit clause-clause subsumptions : 9
% 0.14/0.45 % Unit Clause-clause subsumption calls : 11
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 5
% 0.14/0.45 % BW rewrite match successes : 2
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 9907
% 0.14/0.45 % Search garbage collected termcells : 2704
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.009 s
% 0.14/0.45 % System time : 0.005 s
% 0.14/0.45 % Total time : 0.014 s
% 0.14/0.45 % Maximum resident set size: 4576 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.029 s
% 0.14/0.45 % System time : 0.011 s
% 0.14/0.45 % Total time : 0.040 s
% 0.14/0.45 % Maximum resident set size: 5632 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------