%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR051+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 : n004.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:15 PM UTC 2026
% Result : Theorem 0.27s 0.59s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 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 : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query151,conjecture,
? [X15] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151) ).
fof(ax2_395,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_395) ).
fof(c_0_2,negated_conjecture,
~ ? [X15] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X15) ),
inference(assume_negation,[status(cth)],[query151]) ).
fof(c_0_3,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_395])]) ).
fof(c_0_4,negated_conjecture,
! [X23] :
( ~ marriagelicensedocument(X23)
& mtvisible(c_tptp_member3356_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ marriagelicensedocument(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051+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.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:36:04 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.27/0.59 % Version: 3.5.1
% 0.27/0.59 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.27/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.27/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59 % Starting sh5l with 300s (1) cores
% 0.27/0.59 % sh5l with pid 3385296 completed with status 0
% 0.27/0.59 % Result found by sh5l
% 0.27/0.59 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.27/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.27/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59 % Starting sh5l with 300s (1) cores
% 0.27/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.59 % Search class: FHHNM-FFMM33-SFFFFFNN
% 0.27/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.59 % SubtermCWHack with pid 3385297 completed with status 0
% 0.27/0.59 % Result found by SubtermCWHack
% 0.27/0.59 % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.27/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.27/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59 % Starting sh5l with 300s (1) cores
% 0.27/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.59 % Search class: FHHNM-FFMM33-SFFFFFNN
% 0.27/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.59 % Preprocessing time : 0.007 s
% 0.27/0.59
% 0.27/0.59 % Proof found!
% 0.27/0.59 % SZS status Theorem
% 0.27/0.59 % SZS output start CNFRefutation
% See solution above
% 0.27/0.59 % Parsed axioms : 8006
% 0.27/0.59 % Removed by relevancy pruning/SinE : 7877
% 0.27/0.59 % Initial clauses : 130
% 0.27/0.59 % Removed in clause preprocessing : 0
% 0.27/0.59 % Initial clauses in saturation : 130
% 0.27/0.59 % Processed clauses : 11
% 0.27/0.59 % ...of these trivial : 0
% 0.27/0.59 % ...subsumed : 0
% 0.27/0.59 % ...remaining for further processing : 10
% 0.27/0.59 % Other redundant clauses eliminated : 0
% 0.27/0.59 % Clauses deleted for lack of memory : 0
% 0.27/0.59 % Backward-subsumed : 0
% 0.27/0.59 % Backward-rewritten : 0
% 0.27/0.59 % Generated clauses : 0
% 0.27/0.59 % ...of the previous two non-redundant : 0
% 0.27/0.59 % ...aggressively subsumed : 0
% 0.27/0.59 % Contextual simplify-reflections : 0
% 0.27/0.59 % Paramodulations : 0
% 0.27/0.59 % Factorizations : 0
% 0.27/0.59 % NegExts : 0
% 0.27/0.59 % Equation resolutions : 0
% 0.27/0.59 % Disequality decompositions : 0
% 0.27/0.59 % Total rewrite steps : 1
% 0.27/0.59 % ...of those cached : 0
% 0.27/0.59 % Propositional unsat checks : 0
% 0.27/0.59 % Propositional check models : 0
% 0.27/0.59 % Propositional check unsatisfiable : 0
% 0.27/0.59 % Propositional clauses : 0
% 0.27/0.59 % Propositional clauses after purity: 0
% 0.27/0.59 % Propositional unsat core size : 0
% 0.27/0.59 % Propositional preprocessing time : 0.000
% 0.27/0.59 % Propositional encoding time : 0.000
% 0.27/0.59 % Propositional solver time : 0.000
% 0.27/0.59 % Success case prop preproc time : 0.000
% 0.27/0.59 % Success case prop encoding time : 0.000
% 0.27/0.59 % Success case prop solver time : 0.000
% 0.27/0.59 % Current number of processed clauses : 10
% 0.27/0.59 % Positive orientable unit clauses : 9
% 0.27/0.59 % Positive unorientable unit clauses: 0
% 0.27/0.59 % Negative unit clauses : 1
% 0.27/0.59 % Non-unit-clauses : 0
% 0.27/0.59 % Current number of unprocessed clauses: 119
% 0.27/0.59 % ...number of literals in the above : 180
% 0.27/0.59 % Current number of archived formulas : 0
% 0.27/0.59 % Current number of archived clauses : 0
% 0.27/0.59 % Clause-clause subsumption calls (NU) : 0
% 0.27/0.59 % Rec. Clause-clause subsumption calls : 0
% 0.27/0.59 % Non-unit clause-clause subsumptions : 0
% 0.27/0.59 % Unit Clause-clause subsumption calls : 0
% 0.27/0.59 % Rewrite failures with RHS unbound : 0
% 0.27/0.59 % BW rewrite match attempts : 0
% 0.27/0.59 % BW rewrite match successes : 0
% 0.27/0.59 % Condensation attempts : 0
% 0.27/0.59 % Condensation successes : 0
% 0.27/0.59 % Termbank termtop insertions : 54985
% 0.27/0.59 % Search garbage collected termcells : 31160
% 0.27/0.59
% 0.27/0.59 % -------------------------------------------------
% 0.27/0.59 % User time : 0.015 s
% 0.27/0.59 % System time : 0.022 s
% 0.27/0.59 % Total time : 0.038 s
% 0.27/0.59 % Maximum resident set size: 20596 pages
% 0.27/0.59
% 0.27/0.59 % -------------------------------------------------
% 0.27/0.59 % User time : 0.134 s
% 0.27/0.59 % System time : 0.033 s
% 0.27/0.59 % Total time : 0.167 s
% 0.27/0.59 % Maximum resident set size: 11264 pages
% 0.27/0.59 % E exiting
%------------------------------------------------------------------------------