%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR014+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:15:54 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 24 unt; 0 def)
% Number of atoms : 74 ( 28 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 74 ( 38 ~; 25 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 44 ( 2 sgn 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(keep_not_released,axiom,
! [X2,X5] :
( ( ~ ? [X4] :
( releases(X4,X2,X5)
& happens(X4,X5) )
& ~ releasedAt(X2,X5) )
=> ~ releasedAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',keep_not_released) ).
fof(filling_not_waterLevel,axiom,
! [X12] : filling != waterLevel(X12),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+1.ax',filling_not_waterLevel) ).
fof(releases_all_defn,axiom,
! [X4,X2,X5] :
( releases(X4,X2,X5)
<=> ? [X9] :
( X2 = waterLevel(X9)
& X4 = tapOn ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+1.ax',releases_all_defn) ).
fof(symmetry_of_plus,axiom,
! [X12,X13] : plus(X12,X13) = plus(X13,X12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(plus1_1,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).
fof(filling_3_l1,conjecture,
~ releasedAt(filling,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',filling_3_l1) ).
fof(not_released_filling_0,hypothesis,
~ releasedAt(filling,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_released_filling_0) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(c_0_9,plain,
! [X2,X5] :
( ( ~ ? [X4] :
( releases(X4,X2,X5)
& happens(X4,X5) )
& ~ releasedAt(X2,X5) )
=> ~ releasedAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[keep_not_released]) ).
fof(c_0_10,plain,
! [X12] : filling != waterLevel(X12),
inference(fof_simplification,[status(thm)],[filling_not_waterLevel]) ).
fof(c_0_11,plain,
! [X74,X75,X76,X78,X79,X80,X81] :
( ( releases(X78,X79,X81)
| X79 != waterLevel(X80)
| X78 != tapOn )
& ( ~ releases(X74,X75,X76)
| X75 = waterLevel(esk9_2(X74,X75)) )
& ( ~ releases(X74,X75,X76)
| X74 = tapOn ) ),
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)],[releases_all_defn])])])])])])]) ).
fof(c_0_12,plain,
! [X53,X54] :
( ( ~ releasedAt(X53,plus(X54,n1))
| releasedAt(X53,X54)
| releases(esk8_2(X53,X54),X53,X54) )
& ( ~ releasedAt(X53,plus(X54,n1))
| releasedAt(X53,X54)
| happens(esk8_2(X53,X54),X54) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_13,plain,
! [X91] : filling != waterLevel(X91),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,plain,
( ~ releases(X2,X1,X3)
| X1 = waterLevel(esk9_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ releasedAt(X1,plus(X2,n1))
| releasedAt(X1,X2)
| releases(esk8_2(X1,X2),X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
filling != waterLevel(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ releasedAt(X1,plus(X2,n1))
| releasedAt(X1,X2)
| waterLevel(esk9_2(esk8_2(X1,X2),X1)) = X1 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X95,X96] : plus(X95,X96) = plus(X96,X95),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
cnf(c_0_19,plain,
( ~ releasedAt(X1,plus(X2,n1))
| X1 != filling
| releasedAt(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[plus1_1]) ).
cnf(c_0_22,plain,
( ~ releasedAt(X1,plus(n1,X2))
| X1 != filling
| releasedAt(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
fof(c_0_24,negated_conjecture,
~ ~ releasedAt(filling,n3),
inference(assume_negation,[status(cth)],[filling_3_l1]) ).
fof(c_0_25,hypothesis,
~ releasedAt(filling,n0),
inference(fof_simplification,[status(thm)],[not_released_filling_0]) ).
cnf(c_0_26,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
cnf(c_0_27,plain,
( ~ releasedAt(X1,n2)
| X1 != filling
| releasedAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_28,plain,
( ~ releasedAt(X1,n3)
| X1 != filling
| releasedAt(X1,n2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,negated_conjecture,
releasedAt(filling,n3),
inference(fof_simplification,[status(thm)],[c_0_24]) ).
fof(c_0_30,hypothesis,
~ releasedAt(filling,n0),
inference(fof_nnf,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_32,plain,
( ~ releasedAt(X1,n3)
| X1 != filling
| releasedAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
releasedAt(filling,n3),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,hypothesis,
~ releasedAt(filling,n0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( ~ releasedAt(X1,n1)
| X1 != filling
| releasedAt(X1,n0) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
releasedAt(filling,n1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR014+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 14:23:49 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/0.39 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.16/0.46 % Version: 3.5.1
% 0.16/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 103232 completed with status 0
% 0.16/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.46 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 % Starting U----_116_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN1 with 136s (1) cores
% 0.16/0.46 % G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 103243 completed with status 0
% 0.16/0.46 % Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.16/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FGHSF-FSLM32-SFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.46 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.16/0.46 % Preprocessing time : 0.003 s
% 0.16/0.46 % Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 % Proof found!
% 0.16/0.46 % SZS status Theorem
% 0.16/0.46 % SZS output start CNFRefutation
% See solution above
% 0.16/0.46 % Parsed axioms : 55
% 0.16/0.46 % Removed by relevancy pruning/SinE : 0
% 0.16/0.46 % Initial clauses : 137
% 0.16/0.46 % Removed in clause preprocessing : 1
% 0.16/0.46 % Initial clauses in saturation : 136
% 0.16/0.46 % Processed clauses : 614
% 0.16/0.46 % ...of these trivial : 1
% 0.16/0.46 % ...subsumed : 218
% 0.16/0.46 % ...remaining for further processing : 395
% 0.16/0.46 % Other redundant clauses eliminated : 30
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 12
% 0.16/0.46 % Backward-rewritten : 2
% 0.16/0.46 % Generated clauses : 927
% 0.16/0.46 % ...of the previous two non-redundant : 783
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 0
% 0.16/0.46 % Paramodulations : 884
% 0.16/0.46 % Factorizations : 4
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 34
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 80
% 0.16/0.46 % ...of those cached : 60
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 261
% 0.16/0.46 % Positive orientable unit clauses : 25
% 0.16/0.46 % Positive unorientable unit clauses: 1
% 0.16/0.46 % Negative unit clauses : 44
% 0.16/0.46 % Non-unit-clauses : 191
% 0.16/0.46 % Current number of unprocessed clauses: 417
% 0.16/0.46 % ...number of literals in the above : 1916
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 130
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 5531
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 3176
% 0.16/0.46 % Non-unit clause-clause subsumptions : 89
% 0.16/0.46 % Unit Clause-clause subsumption calls : 1520
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 52
% 0.16/0.46 % BW rewrite match successes : 42
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 16580
% 0.16/0.46 % Search garbage collected termcells : 1496
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.043 s
% 0.16/0.46 % System time : 0.004 s
% 0.16/0.46 % Total time : 0.047 s
% 0.16/0.46 % Maximum resident set size: 3904 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.151 s
% 0.16/0.46 % System time : 0.021 s
% 0.16/0.46 % Total time : 0.172 s
% 0.16/0.46 % Maximum resident set size: 4608 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------