%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR032+6 : TPTP v9.3.1. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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.61s 157.54s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 22 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 7 ~; 4 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 4 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax5_444511,axiom,
! [X2,X3] :
( X2 = X3
=> thing(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+5.ax',ax5_444511) ).
fof(query282,conjecture,
? [X34] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query282) ).
fof(ax5_3341059,axiom,
! [X16] :
( thing(X16)
=> isa(X16,c_thing) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+5.ax',ax5_3341059) ).
fof(c_0_3,plain,
! [X1707,X1708] :
( thing(X1708)
| X1707 != X1708 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5_444511])])]) ).
fof(c_0_4,negated_conjecture,
~ ? [X34] :
( mtvisible(c_reasoningaboutpossibleantecedentsmt)
=> isa(f_citynamedfn(s_agen,c_france),X34) ),
inference(assume_negation,[status(cth)],[query282]) ).
fof(c_0_5,plain,
! [X1767] :
( isa(X1767,c_thing)
| ~ thing(X1767) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5_3341059])])]) ).
cnf(c_0_6,plain,
( X1 != X2
| thing(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
! [X35] :
( ~ isa(f_citynamedfn(s_agen,c_france),X35)
& mtvisible(c_reasoningaboutpossibleantecedentsmt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( ~ thing(X1)
| isa(X1,c_thing) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
thing(X1),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ isa(f_citynamedfn(s_agen,c_france),X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
isa(X1,c_thing),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR032+6 : TPTP v9.3.1. Bugfixed v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/15.69 % CPULimit : 300
% 0.10/15.69 % WCLimit : 300
% 0.10/15.69 % DateTime : Mon Sep 21 14:28:17 UTC 2026
% 0.55/15.70 % CPUTime :
% 0.55/15.70 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.55/15.77 Running first-order theorem proving
% 0.55/15.77 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.61/157.54 % Version: 3.5.1
% 0.61/157.54 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.61/157.54 % Scheduled 4 strats onto 8 cores with 195 seconds (1560 total)
% 0.61/157.54 % Starting new_ho_10 with 390s (2) cores
% 0.61/157.54 % Starting sh3 with 390s (2) cores
% 0.61/157.54 % Starting ho_unfolding_3 with 390s (2) cores
% 0.61/157.54 % Starting new_ho_10_cnf2 with 390s (2) cores
% 0.61/157.54 % sh3 with pid 353826 completed with status 0
% 0.61/157.54 % Result found by sh3
% 0.61/157.54 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.61/157.54 % Scheduled 4 strats onto 8 cores with 195 seconds (1560 total)
% 0.61/157.54 % Starting new_ho_10 with 390s (2) cores
% 0.61/157.54 % Starting sh3 with 390s (2) cores
% 0.61/157.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/157.54 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.61/157.54 % Search class: FHHSM-SMLM31-MFFFFFNN
% 0.61/157.54 % Scheduled 7 strats onto 2 cores with 364 seconds (364 total)
% 0.61/157.54 % Starting SubtermCWHack with 33s (1) cores
% 0.61/157.54 % Starting sh3 with 37s (1) cores
% 0.61/157.54 % SubtermCWHack with pid 353833 completed with status 0
% 0.61/157.54 % Result found by SubtermCWHack
% 0.61/157.54 % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.61/157.54 % Scheduled 4 strats onto 8 cores with 195 seconds (1560 total)
% 0.61/157.54 % Starting new_ho_10 with 390s (2) cores
% 0.61/157.54 % Starting sh3 with 390s (2) cores
% 0.61/157.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/157.54 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.61/157.54 % Search class: FHHSM-SMLM31-MFFFFFNN
% 0.61/157.54 % Scheduled 7 strats onto 2 cores with 364 seconds (364 total)
% 0.61/157.54 % Starting SubtermCWHack with 33s (1) cores
% 0.61/157.54 % Preprocessing time : 1.488 s
% 0.61/157.54
% 0.61/157.54 % Proof found!
% 0.61/157.54 % SZS status Theorem
% 0.61/157.54 % SZS output start CNFRefutation
% See solution above
% 0.61/157.54 % Parsed axioms : 3341978
% 0.61/157.54 % Removed by relevancy pruning/SinE : 3321977
% 0.61/157.54 % Initial clauses : 20002
% 0.61/157.54 % Removed in clause preprocessing : 2
% 0.61/157.54 % Initial clauses in saturation : 20000
% 0.61/157.54 % Processed clauses : 16287
% 0.61/157.54 % ...of these trivial : 1957
% 0.61/157.54 % ...subsumed : 143
% 0.61/157.54 % ...remaining for further processing : 14187
% 0.61/157.54 % Other redundant clauses eliminated : 1
% 0.61/157.54 % Clauses deleted for lack of memory : 0
% 0.61/157.54 % Backward-subsumed : 7
% 0.61/157.54 % Backward-rewritten : 955
% 0.61/157.54 % Generated clauses : 13159
% 0.61/157.54 % ...of the previous two non-redundant : 8719
% 0.61/157.54 % ...aggressively subsumed : 0
% 0.61/157.54 % Contextual simplify-reflections : 0
% 0.61/157.54 % Paramodulations : 13158
% 0.61/157.54 % Factorizations : 0
% 0.61/157.54 % NegExts : 0
% 0.61/157.54 % Equation resolutions : 1
% 0.61/157.54 % Disequality decompositions : 0
% 0.61/157.54 % Total rewrite steps : 7309
% 0.61/157.54 % ...of those cached : 4380
% 0.61/157.54 % Propositional unsat checks : 0
% 0.61/157.54 % Propositional check models : 0
% 0.61/157.54 % Propositional check unsatisfiable : 0
% 0.61/157.54 % Propositional clauses : 0
% 0.61/157.54 % Propositional clauses after purity: 0
% 0.61/157.54 % Propositional unsat core size : 0
% 0.61/157.54 % Propositional preprocessing time : 0.000
% 0.61/157.54 % Propositional encoding time : 0.000
% 0.61/157.54 % Propositional solver time : 0.000
% 0.61/157.54 % Success case prop preproc time : 0.000
% 0.61/157.54 % Success case prop encoding time : 0.000
% 0.61/157.54 % Success case prop solver time : 0.000
% 0.61/157.54 % Current number of processed clauses : 13224
% 0.61/157.54 % Positive orientable unit clauses : 9541
% 0.61/157.54 % Positive unorientable unit clauses: 0
% 0.61/157.54 % Negative unit clauses : 1376
% 0.61/157.54 % Non-unit-clauses : 2307
% 0.61/157.54 % Current number of unprocessed clauses: 12242
% 0.61/157.54 % ...number of literals in the above : 17318
% 0.61/157.54 % Current number of archived formulas : 0
% 0.61/157.54 % Current number of archived clauses : 962
% 0.61/157.54 % Clause-clause subsumption calls (NU) : 252304
% 0.61/157.54 % Rec. Clause-clause subsumption calls : 231563
% 0.61/157.54 % Non-unit clause-clause subsumptions : 143
% 0.61/157.54 % Unit Clause-clause subsumption calls : 1326945
% 0.61/157.54 % Rewrite failures with RHS unbound : 0
% 0.61/157.54 % BW rewrite match attempts : 4780
% 0.61/157.54 % BW rewrite match successes : 962
% 0.61/157.54 % Condensation attempts : 0
% 0.61/157.54 % Condensation successes : 0
% 0.61/157.54 % Termbank termtop insertions : 22703780
% 0.61/157.54 % Search garbage collected termcells : 10471887
% 0.61/157.54
% 0.61/157.54 % -------------------------------------------------
% 0.61/157.54 % User time : 25.633 s
% 0.61/157.54 % System time : 7.586 s
% 0.61/157.54 % Total time : 33.219 s
% 0.61/157.54 % Maximum resident set size: 5020868 pages
% 0.61/157.54
% 0.61/157.54 % -------------------------------------------------
% 0.61/157.54 % User time : 131.876 s
% 0.61/157.54 % System time : 14.853 s
% 0.61/157.54 % Total time : 146.729 s
% 0.61/157.54 % Maximum resident set size: 2273536 pages
% 0.61/157.54 % E exiting
%------------------------------------------------------------------------------