%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR032+4 : 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 : n010.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:01 PM UTC 2026
% Result : Theorem 0.15s 6.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 1 sgn 3 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query182,conjecture,
? [X24] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X24) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query182) ).
fof(ax3_44154,axiom,
! [X16] :
( individual(X16)
=> isa(X16,c_individual) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_44154) ).
fof(ax3_14987,axiom,
individual(f_citynamedfn(s_agen,c_france)),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_14987) ).
fof(c_0_3,negated_conjecture,
~ ? [X24] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X24) ),
inference(assume_negation,[status(cth)],[query182]) ).
fof(c_0_4,plain,
! [X75] :
( isa(X75,c_individual)
| ~ individual(X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44154])])]) ).
fof(c_0_5,negated_conjecture,
! [X25] :
( ~ isa(f_citynamedfn(s_agen,c_france),X25)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( ~ individual(X1)
| isa(X1,c_individual) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
individual(f_citynamedfn(s_agen,c_france)),
inference(split_conjunct,[status(thm)],[ax3_14987]) ).
cnf(c_0_8,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR032+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.37 % Computer : n010.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 14:27:02 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.42 Running first-order theorem proving
% 0.13/5.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.15/6.50 % Version: 3.5.1
% 0.15/6.50 % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.15/6.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/6.50 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.15/6.50 % Starting new_bool_3 with 300s (1) cores
% 0.15/6.50 % Starting new_bool_1 with 300s (1) cores
% 0.15/6.50 % Starting sh5l with 300s (1) cores
% 0.15/6.50 % new_bool_1 with pid 1099915 completed with status 0
% 0.15/6.50 % Result found by new_bool_1
% 0.15/6.50 % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.15/6.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/6.50 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.15/6.50 % Starting new_bool_3 with 300s (1) cores
% 0.15/6.50 % Starting new_bool_1 with 300s (1) cores
% 0.15/6.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/6.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/6.50 % Search class: FHUNM-FFMM32-SFFFFFNN
% 0.15/6.50 % partial match(1): FHUNM-FFMM22-SFFFFFNN
% 0.15/6.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/6.50 % Starting SubtermCWHack with 31s (1) cores
% 0.15/6.50 % SubtermCWHack with pid 1099917 completed with status 0
% 0.15/6.50 % Result found by SubtermCWHack
% 0.15/6.50 % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.15/6.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/6.50 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.15/6.50 % Starting new_bool_3 with 300s (1) cores
% 0.15/6.50 % Starting new_bool_1 with 300s (1) cores
% 0.15/6.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/6.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/6.50 % Search class: FHUNM-FFMM32-SFFFFFNN
% 0.15/6.50 % partial match(1): FHUNM-FFMM22-SFFFFFNN
% 0.15/6.50 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/6.50 % Starting SubtermCWHack with 31s (1) cores
% 0.15/6.50 % Preprocessing time : 0.017 s
% 0.15/6.50
% 0.15/6.50 % Proof found!
% 0.15/6.50 % SZS status Theorem
% 0.15/6.50 % SZS output start CNFRefutation
% See solution above
% 0.15/6.50 % Parsed axioms : 44217
% 0.15/6.50 % Removed by relevancy pruning/SinE : 44152
% 0.15/6.50 % Initial clauses : 66
% 0.15/6.50 % Removed in clause preprocessing : 0
% 0.15/6.50 % Initial clauses in saturation : 66
% 0.15/6.50 % Processed clauses : 37
% 0.15/6.50 % ...of these trivial : 5
% 0.15/6.50 % ...subsumed : 0
% 0.15/6.50 % ...remaining for further processing : 31
% 0.15/6.50 % Other redundant clauses eliminated : 0
% 0.15/6.50 % Clauses deleted for lack of memory : 0
% 0.15/6.50 % Backward-subsumed : 0
% 0.15/6.50 % Backward-rewritten : 0
% 0.15/6.50 % Generated clauses : 4
% 0.15/6.50 % ...of the previous two non-redundant : 2
% 0.15/6.50 % ...aggressively subsumed : 0
% 0.15/6.50 % Contextual simplify-reflections : 0
% 0.15/6.50 % Paramodulations : 4
% 0.15/6.50 % Factorizations : 0
% 0.15/6.50 % NegExts : 0
% 0.15/6.50 % Equation resolutions : 0
% 0.15/6.50 % Disequality decompositions : 0
% 0.15/6.50 % Total rewrite steps : 5
% 0.15/6.50 % ...of those cached : 1
% 0.15/6.50 % Propositional unsat checks : 0
% 0.15/6.50 % Propositional check models : 0
% 0.15/6.50 % Propositional check unsatisfiable : 0
% 0.15/6.50 % Propositional clauses : 0
% 0.15/6.50 % Propositional clauses after purity: 0
% 0.15/6.50 % Propositional unsat core size : 0
% 0.15/6.50 % Propositional preprocessing time : 0.000
% 0.15/6.50 % Propositional encoding time : 0.000
% 0.15/6.50 % Propositional solver time : 0.000
% 0.15/6.50 % Success case prop preproc time : 0.000
% 0.15/6.50 % Success case prop encoding time : 0.000
% 0.15/6.50 % Success case prop solver time : 0.000
% 0.15/6.50 % Current number of processed clauses : 31
% 0.15/6.50 % Positive orientable unit clauses : 26
% 0.15/6.50 % Positive unorientable unit clauses: 0
% 0.15/6.50 % Negative unit clauses : 1
% 0.15/6.50 % Non-unit-clauses : 4
% 0.15/6.50 % Current number of unprocessed clauses: 31
% 0.15/6.50 % ...number of literals in the above : 52
% 0.15/6.50 % Current number of archived formulas : 0
% 0.15/6.50 % Current number of archived clauses : 0
% 0.15/6.50 % Clause-clause subsumption calls (NU) : 0
% 0.15/6.50 % Rec. Clause-clause subsumption calls : 0
% 0.15/6.50 % Non-unit clause-clause subsumptions : 0
% 0.15/6.50 % Unit Clause-clause subsumption calls : 3
% 0.15/6.50 % Rewrite failures with RHS unbound : 0
% 0.15/6.50 % BW rewrite match attempts : 0
% 0.15/6.50 % BW rewrite match successes : 0
% 0.15/6.50 % Condensation attempts : 0
% 0.15/6.50 % Condensation successes : 0
% 0.15/6.50 % Termbank termtop insertions : 294204
% 0.15/6.50 % Search garbage collected termcells : 157610
% 0.15/6.50
% 0.15/6.50 % -------------------------------------------------
% 0.15/6.50 % User time : 0.173 s
% 0.15/6.50 % System time : 0.097 s
% 0.15/6.50 % Total time : 0.270 s
% 0.15/6.50 % Maximum resident set size: 84020 pages
% 0.15/6.50
% 0.15/6.50 % -------------------------------------------------
% 0.15/6.50 % User time : 0.908 s
% 0.15/6.50 % System time : 0.151 s
% 0.15/6.50 % Total time : 1.059 s
% 0.15/6.50 % Maximum resident set size: 38144 pages
% 0.15/6.50 % E exiting
%------------------------------------------------------------------------------