%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR098+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:50 PM UTC 2026
% Result : Theorem 6.40s 4.27s
% Output : CNFRefutation 6.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 68 ( 15 equ)
% Maximal formula atoms : 45 ( 5 avg)
% Number of connectives : 86 ( 31 ~; 36 |; 16 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 28 ( 7 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2341] : s__instance(X2341,s__Amphibian),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X137,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X136,s__SetOrClass) )
=> ( ( s__instance(X1139,X12)
& s__instance(X34,X137)
& s__instance(X1138,X136) )
=> ( ( s__instance(X1139,X137)
| s__instance(X1139,X136) )
& s__instance(X34,X12)
& s__instance(X1138,X12) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_51184,axiom,
s__instance(s__secretesToxin__m,s__BinaryPredicate),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_51184) ).
fof(c_0_3,negated_conjecture,
~ ? [X2341] : s__instance(X2341,s__Amphibian),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_4,negated_conjecture,
! [X2342] : ~ s__instance(X2342,s__Amphibian),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2530,X2531,X2532,X2533,X2534,X2535,X2536,X2537,X2538] :
( ( X2537 = s__UnionFn(X2538,X2536)
| ~ s__instance(esk12_3(X2536,X2537,X2538),X2537)
| ~ s__instance(esk11_3(X2536,X2537,X2538),X2537)
| ~ s__instance(esk13_3(X2536,X2537,X2538),X2536) )
& ( X2537 = s__UnionFn(X2538,X2536)
| ~ s__instance(esk12_3(X2536,X2537,X2538),X2537)
| ~ s__instance(esk11_3(X2536,X2537,X2538),X2537)
| ~ s__instance(esk13_3(X2536,X2537,X2538),X2538) )
& ( X2537 = s__UnionFn(X2538,X2536)
| s__instance(esk13_3(X2536,X2537,X2538),X2537) )
& ( X2537 = s__UnionFn(X2538,X2536)
| s__instance(esk12_3(X2536,X2537,X2538),X2536) )
& ( X2537 = s__UnionFn(X2538,X2536)
| s__instance(esk11_3(X2536,X2537,X2538),X2538) )
& ( X2537 = s__UnionFn(X2538,X2536)
| s__instance(X2536,s__SetOrClass) )
& ( X2537 = s__UnionFn(X2538,X2536)
| s__instance(X2537,s__SetOrClass) )
& ( X2537 = s__UnionFn(X2538,X2536)
| s__instance(X2538,s__SetOrClass) )
& ( X2531 != s__UnionFn(X2532,X2530)
| ~ s__instance(X2530,s__SetOrClass)
| ~ s__instance(X2531,s__SetOrClass)
| ~ s__instance(X2532,s__SetOrClass)
| ~ s__instance(X2535,X2531)
| ~ s__instance(X2534,X2530)
| ~ s__instance(X2533,X2532)
| s__instance(X2535,X2530)
| s__instance(X2535,X2532) )
& ( X2531 != s__UnionFn(X2532,X2530)
| ~ s__instance(X2530,s__SetOrClass)
| ~ s__instance(X2531,s__SetOrClass)
| ~ s__instance(X2532,s__SetOrClass)
| ~ s__instance(X2535,X2531)
| ~ s__instance(X2534,X2530)
| ~ s__instance(X2533,X2532)
| s__instance(X2534,X2531) )
& ( X2531 != s__UnionFn(X2532,X2530)
| ~ s__instance(X2530,s__SetOrClass)
| ~ s__instance(X2531,s__SetOrClass)
| ~ s__instance(X2532,s__SetOrClass)
| ~ s__instance(X2535,X2531)
| ~ s__instance(X2534,X2530)
| ~ s__instance(X2533,X2532)
| s__instance(X2533,X2531) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
~ s__instance(X1,s__Amphibian),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(esk11_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
X1 = s__UnionFn(s__Amphibian,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
s__instance(s__secretesToxin__m,s__BinaryPredicate),
inference(split_conjunct,[status(thm)],[kb_SUMO_51184]) ).
cnf(c_0_11,negated_conjecture,
~ s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR098+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n007.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 14:56:05 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.50 Running first-order theorem proving
% 0.25/0.50 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
% 6.40/4.27 % Version: 3.5.1
% 6.40/4.27 % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.40/4.27 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.40/4.27 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 6.40/4.27 % Starting new_bool_3 with 298s (1) cores
% 6.40/4.27 % Starting new_bool_1 with 298s (1) cores
% 6.40/4.27 % Starting sh5l with 298s (1) cores
% 6.40/4.27 % new_bool_1 with pid 1357541 completed with status 0
% 6.40/4.27 % Result found by new_bool_1
% 6.40/4.27 % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.40/4.27 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.40/4.27 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 6.40/4.27 % Starting new_bool_3 with 298s (1) cores
% 6.40/4.27 % Starting new_bool_1 with 298s (1) cores
% 6.40/4.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 6.40/4.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.40/4.27 % Search class: FGHSS-FSLM32-MFFFFFNN
% 6.40/4.27 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 6.40/4.27 % Starting SubtermCWHack with 30s (1) cores
% 6.40/4.27 % SubtermCWHack with pid 1357543 completed with status 0
% 6.40/4.27 % Result found by SubtermCWHack
% 6.40/4.27 % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.40/4.27 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.40/4.27 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 6.40/4.27 % Starting new_bool_3 with 298s (1) cores
% 6.40/4.27 % Starting new_bool_1 with 298s (1) cores
% 6.40/4.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 6.40/4.27 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.40/4.27 % Search class: FGHSS-FSLM32-MFFFFFNN
% 6.40/4.27 % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 6.40/4.27 % Starting SubtermCWHack with 30s (1) cores
% 6.40/4.27 % Preprocessing time : 0.042 s
% 6.40/4.27
% 6.40/4.27 % Proof found!
% 6.40/4.27 % SZS status Theorem
% 6.40/4.27 % SZS output start CNFRefutation
% See solution above
% 6.40/4.27 % Parsed axioms : 55590
% 6.40/4.27 % Removed by relevancy pruning/SinE : 55452
% 6.40/4.27 % Initial clauses : 215
% 6.40/4.27 % Removed in clause preprocessing : 19
% 6.40/4.27 % Initial clauses in saturation : 196
% 6.40/4.27 % Processed clauses : 164
% 6.40/4.27 % ...of these trivial : 12
% 6.40/4.27 % ...subsumed : 1
% 6.40/4.27 % ...remaining for further processing : 151
% 6.40/4.27 % Other redundant clauses eliminated : 1
% 6.40/4.27 % Clauses deleted for lack of memory : 0
% 6.40/4.27 % Backward-subsumed : 44
% 6.40/4.27 % Backward-rewritten : 57
% 6.40/4.27 % Generated clauses : 815
% 6.40/4.27 % ...of the previous two non-redundant : 796
% 6.40/4.27 % ...aggressively subsumed : 0
% 6.40/4.27 % Contextual simplify-reflections : 0
% 6.40/4.27 % Paramodulations : 806
% 6.40/4.27 % Factorizations : 2
% 6.40/4.27 % NegExts : 0
% 6.40/4.27 % Equation resolutions : 1
% 6.40/4.27 % Disequality decompositions : 0
% 6.40/4.27 % Total rewrite steps : 84
% 6.40/4.27 % ...of those cached : 15
% 6.40/4.27 % Propositional unsat checks : 0
% 6.40/4.27 % Propositional check models : 0
% 6.40/4.27 % Propositional check unsatisfiable : 0
% 6.40/4.27 % Propositional clauses : 0
% 6.40/4.27 % Propositional clauses after purity: 0
% 6.40/4.27 % Propositional unsat core size : 0
% 6.40/4.27 % Propositional preprocessing time : 0.000
% 6.40/4.27 % Propositional encoding time : 0.000
% 6.40/4.27 % Propositional solver time : 0.000
% 6.40/4.27 % Success case prop preproc time : 0.000
% 6.40/4.27 % Success case prop encoding time : 0.000
% 6.40/4.27 % Success case prop solver time : 0.000
% 6.40/4.27 % Current number of processed clauses : 43
% 6.40/4.27 % Positive orientable unit clauses : 41
% 6.40/4.27 % Positive unorientable unit clauses: 1
% 6.40/4.27 % Negative unit clauses : 1
% 6.40/4.27 % Non-unit-clauses : 0
% 6.40/4.27 % Current number of unprocessed clauses: 455
% 6.40/4.27 % ...number of literals in the above : 1238
% 6.40/4.27 % Current number of archived formulas : 0
% 6.40/4.27 % Current number of archived clauses : 107
% 6.40/4.27 % Clause-clause subsumption calls (NU) : 121
% 6.40/4.27 % Rec. Clause-clause subsumption calls : 109
% 6.40/4.27 % Non-unit clause-clause subsumptions : 3
% 6.40/4.27 % Unit Clause-clause subsumption calls : 302
% 6.40/4.27 % Rewrite failures with RHS unbound : 324
% 6.40/4.27 % BW rewrite match attempts : 658
% 6.40/4.27 % BW rewrite match successes : 315
% 6.40/4.27 % Condensation attempts : 0
% 6.40/4.27 % Condensation successes : 0
% 6.40/4.27 % Termbank termtop insertions : 670969
% 6.40/4.27 % Search garbage collected termcells : 293677
% 6.40/4.27
% 6.40/4.27 % -------------------------------------------------
% 6.40/4.27 % User time : 0.421 s
% 6.40/4.27 % System time : 0.218 s
% 6.40/4.27 % Total time : 0.640 s
% 6.40/4.27 % Maximum resident set size: 137016 pages
% 6.40/4.27
% 6.40/4.27 % -------------------------------------------------
% 6.40/4.27 % User time : 3.217 s
% 6.40/4.27 % System time : 0.370 s
% 6.40/4.27 % Total time : 3.587 s
% 6.40/4.27 % Maximum resident set size: 63744 pages
% 6.40/4.27 % E exiting
%------------------------------------------------------------------------------