%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR055+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 12:16:18 PM UTC 2026
% Result : Theorem 0.29s 0.62s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 8 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 11 ~; 4 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query155,conjecture,
~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query155) ).
fof(ax2_3089,axiom,
! [X1] :
~ ( individual(X1)
& collection(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3089) ).
fof(ax2_7583,axiom,
! [X2,X4] :
( disjointwith(X2,X4)
=> collection(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7583) ).
fof(ax2_185,axiom,
individual(c_xskijump_thegame),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_185) ).
fof(c_0_4,negated_conjecture,
~ ~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(assume_negation,[status(cth)],[query155]) ).
fof(c_0_5,plain,
! [X53] :
( ~ individual(X53)
| ~ collection(X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3089])])]) ).
fof(c_0_6,plain,
! [X35,X36] :
( collection(X35)
| ~ disjointwith(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7583])])]) ).
fof(c_0_7,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ individual(X1)
| ~ collection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
individual(c_xskijump_thegame),
inference(split_conjunct,[status(thm)],[ax2_185]) ).
cnf(c_0_10,plain,
( ~ disjointwith(X1,X2)
| collection(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
~ collection(c_xskijump_thegame),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR055+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 14:37:49 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.29/0.62 % Version: 3.5.1
% 0.29/0.62 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.29/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.29/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.62 % Starting sh5l with 300s (1) cores
% 0.29/0.62 % new_bool_3 with pid 3744651 completed with status 0
% 0.29/0.62 % Result found by new_bool_3
% 0.29/0.62 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.29/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.29/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.62 % Search class: FHHNM-FFMM33-SFFFFFNN
% 0.29/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.62 % SubtermCWHack with pid 3744654 completed with status 0
% 0.29/0.62 % Result found by SubtermCWHack
% 0.29/0.62 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.29/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.62 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.29/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.62 % Search class: FHHNM-FFMM33-SFFFFFNN
% 0.29/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.62 % Preprocessing time : 0.006 s
% 0.29/0.62
% 0.29/0.62 % Proof found!
% 0.29/0.62 % SZS status Theorem
% 0.29/0.62 % SZS output start CNFRefutation
% See solution above
% 0.29/0.62 % Parsed axioms : 8006
% 0.29/0.62 % Removed by relevancy pruning/SinE : 7947
% 0.29/0.62 % Initial clauses : 59
% 0.29/0.62 % Removed in clause preprocessing : 0
% 0.29/0.62 % Initial clauses in saturation : 59
% 0.29/0.62 % Processed clauses : 59
% 0.29/0.62 % ...of these trivial : 7
% 0.29/0.62 % ...subsumed : 12
% 0.29/0.62 % ...remaining for further processing : 40
% 0.29/0.62 % Other redundant clauses eliminated : 0
% 0.29/0.62 % Clauses deleted for lack of memory : 0
% 0.29/0.62 % Backward-subsumed : 0
% 0.29/0.62 % Backward-rewritten : 1
% 0.29/0.62 % Generated clauses : 43
% 0.29/0.62 % ...of the previous two non-redundant : 21
% 0.29/0.62 % ...aggressively subsumed : 0
% 0.29/0.62 % Contextual simplify-reflections : 0
% 0.29/0.62 % Paramodulations : 43
% 0.29/0.62 % Factorizations : 0
% 0.29/0.62 % NegExts : 0
% 0.29/0.62 % Equation resolutions : 0
% 0.29/0.62 % Disequality decompositions : 0
% 0.29/0.62 % Total rewrite steps : 23
% 0.29/0.62 % ...of those cached : 12
% 0.29/0.62 % Propositional unsat checks : 0
% 0.29/0.62 % Propositional check models : 0
% 0.29/0.62 % Propositional check unsatisfiable : 0
% 0.29/0.62 % Propositional clauses : 0
% 0.29/0.62 % Propositional clauses after purity: 0
% 0.29/0.62 % Propositional unsat core size : 0
% 0.29/0.62 % Propositional preprocessing time : 0.000
% 0.29/0.62 % Propositional encoding time : 0.000
% 0.29/0.62 % Propositional solver time : 0.000
% 0.29/0.62 % Success case prop preproc time : 0.000
% 0.29/0.62 % Success case prop encoding time : 0.000
% 0.29/0.62 % Success case prop solver time : 0.000
% 0.29/0.62 % Current number of processed clauses : 39
% 0.29/0.62 % Positive orientable unit clauses : 20
% 0.29/0.62 % Positive unorientable unit clauses: 0
% 0.29/0.62 % Negative unit clauses : 1
% 0.29/0.62 % Non-unit-clauses : 18
% 0.29/0.62 % Current number of unprocessed clauses: 20
% 0.29/0.62 % ...number of literals in the above : 44
% 0.29/0.62 % Current number of archived formulas : 0
% 0.29/0.62 % Current number of archived clauses : 1
% 0.29/0.62 % Clause-clause subsumption calls (NU) : 19
% 0.29/0.62 % Rec. Clause-clause subsumption calls : 19
% 0.29/0.62 % Non-unit clause-clause subsumptions : 12
% 0.29/0.62 % Unit Clause-clause subsumption calls : 13
% 0.29/0.62 % Rewrite failures with RHS unbound : 0
% 0.29/0.62 % BW rewrite match attempts : 1
% 0.29/0.62 % BW rewrite match successes : 1
% 0.29/0.62 % Condensation attempts : 0
% 0.29/0.62 % Condensation successes : 0
% 0.29/0.62 % Termbank termtop insertions : 53883
% 0.29/0.62 % Search garbage collected termcells : 31225
% 0.29/0.62
% 0.29/0.62 % -------------------------------------------------
% 0.29/0.62 % User time : 0.034 s
% 0.29/0.62 % System time : 0.023 s
% 0.29/0.62 % Total time : 0.057 s
% 0.29/0.62 % Maximum resident set size: 20084 pages
% 0.29/0.62
% 0.29/0.62 % -------------------------------------------------
% 0.29/0.62 % User time : 0.142 s
% 0.29/0.62 % System time : 0.042 s
% 0.29/0.62 % Total time : 0.185 s
% 0.29/0.62 % Maximum resident set size: 11008 pages
% 0.29/0.62 % E exiting
%------------------------------------------------------------------------------