%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : CSR051+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:18:17 PM UTC 2026
% Result : Theorem 23.44s 17.39s
% Output : CNFRefutation 23.44s
% 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(query251,conjecture,
? [X23] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X23) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query251) ).
fof(ax4_56266,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_56266) ).
fof(c_0_2,negated_conjecture,
~ ? [X23] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X23) ),
inference(assume_negation,[status(cth)],[query251]) ).
fof(c_0_3,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_56266])]) ).
fof(c_0_4,negated_conjecture,
! [X30] :
( ~ marriagelicensedocument(X30)
& 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.02 % Problem : CSR051+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.76 % Computer : n003.cluster.edu
% 0.11/0.76 % Model : x86_64 x86_64
% 0.11/0.76 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.76 % Memory : 8046.5625MB
% 0.11/0.76 % OS : Linux 6.8.0-71-generic
% 0.11/0.76 % CPULimit : 300
% 0.11/0.76 % WCLimit : 300
% 0.11/0.76 % DateTime : Mon Sep 21 14:38:17 UTC 2026
% 0.11/0.76 % CPUTime :
% 0.11/0.76 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.80 Running first-order theorem proving
% 0.14/0.80 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
% 23.44/17.39 % Version: 3.5.1
% 23.44/17.39 % Preprocessing class: FLLLLMLLSSSNFFN.
% 23.44/17.39 % Scheduled 4 strats onto 8 cores with 288 seconds (2304 total)
% 23.44/17.39 % Starting new_ho_10 with 576s (2) cores
% 23.44/17.39 % Starting sh3 with 576s (2) cores
% 23.44/17.39 % Starting ho_unfolding_3 with 576s (2) cores
% 23.44/17.39 % Starting new_ho_10_cnf2 with 576s (2) cores
% 23.44/17.39 % ho_unfolding_3 with pid 362544 completed with status 0
% 23.44/17.39 % Result found by ho_unfolding_3
% 23.44/17.39 % Preprocessing class: FLLLLMLLSSSNFFN.
% 23.44/17.39 % Scheduled 4 strats onto 8 cores with 288 seconds (2304 total)
% 23.44/17.39 % Starting new_ho_10 with 576s (2) cores
% 23.44/17.39 % Starting sh3 with 576s (2) cores
% 23.44/17.39 % Starting ho_unfolding_3 with 576s (2) cores
% 23.44/17.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 23.44/17.39 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 23.44/17.39 % Search class: FHUNF-FFSM00-SFFFFFNN
% 23.44/17.39 % Scheduled 7 strats onto 2 cores with 574 seconds (574 total)
% 23.44/17.39 % Starting SubtermCWHack with 52s (1) cores
% 23.44/17.39 % Starting ho_unfolding_3 with 58s (1) cores
% 23.44/17.39 % ho_unfolding_3 with pid 362942 completed with status 0
% 23.44/17.39 % Result found by ho_unfolding_3
% 23.44/17.39 % Preprocessing class: FLLLLMLLSSSNFFN.
% 23.44/17.39 % Scheduled 4 strats onto 8 cores with 288 seconds (2304 total)
% 23.44/17.39 % Starting new_ho_10 with 576s (2) cores
% 23.44/17.39 % Starting sh3 with 576s (2) cores
% 23.44/17.39 % Starting ho_unfolding_3 with 576s (2) cores
% 23.44/17.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 23.44/17.39 % SinE strategy is gf500_h_gu_R04_F100_L20000
% 23.44/17.39 % Search class: FHUNF-FFSM00-SFFFFFNN
% 23.44/17.39 % Scheduled 7 strats onto 2 cores with 574 seconds (574 total)
% 23.44/17.39 % Starting SubtermCWHack with 52s (1) cores
% 23.44/17.39 % Starting ho_unfolding_3 with 58s (1) cores
% 23.44/17.39 % Preprocessing time : 0.223 s
% 23.44/17.39 % Presaturation interreduction done
% 23.44/17.39
% 23.44/17.39 % Proof found!
% 23.44/17.39 % SZS status Theorem
% 23.44/17.39 % SZS output start CNFRefutation
% See solution above
% 23.44/17.39 % Parsed axioms : 540250
% 23.44/17.39 % Removed by relevancy pruning/SinE : 540208
% 23.44/17.39 % Initial clauses : 43
% 23.44/17.39 % Removed in clause preprocessing : 0
% 23.44/17.39 % Initial clauses in saturation : 43
% 23.44/17.39 % Processed clauses : 4
% 23.44/17.39 % ...of these trivial : 0
% 23.44/17.39 % ...subsumed : 0
% 23.44/17.39 % ...remaining for further processing : 3
% 23.44/17.39 % Other redundant clauses eliminated : 0
% 23.44/17.39 % Clauses deleted for lack of memory : 0
% 23.44/17.39 % Backward-subsumed : 0
% 23.44/17.39 % Backward-rewritten : 0
% 23.44/17.39 % Generated clauses : 0
% 23.44/17.39 % ...of the previous two non-redundant : 0
% 23.44/17.39 % ...aggressively subsumed : 0
% 23.44/17.39 % Contextual simplify-reflections : 0
% 23.44/17.39 % Paramodulations : 0
% 23.44/17.39 % Factorizations : 0
% 23.44/17.39 % NegExts : 0
% 23.44/17.39 % Equation resolutions : 0
% 23.44/17.39 % Disequality decompositions : 0
% 23.44/17.39 % Total rewrite steps : 1
% 23.44/17.39 % ...of those cached : 0
% 23.44/17.39 % Propositional unsat checks : 0
% 23.44/17.39 % Propositional check models : 0
% 23.44/17.39 % Propositional check unsatisfiable : 0
% 23.44/17.39 % Propositional clauses : 0
% 23.44/17.39 % Propositional clauses after purity: 0
% 23.44/17.39 % Propositional unsat core size : 0
% 23.44/17.39 % Propositional preprocessing time : 0.000
% 23.44/17.39 % Propositional encoding time : 0.000
% 23.44/17.39 % Propositional solver time : 0.000
% 23.44/17.39 % Success case prop preproc time : 0.000
% 23.44/17.39 % Success case prop encoding time : 0.000
% 23.44/17.39 % Success case prop solver time : 0.000
% 23.44/17.39 % Current number of processed clauses : 3
% 23.44/17.39 % Positive orientable unit clauses : 2
% 23.44/17.39 % Positive unorientable unit clauses: 0
% 23.44/17.39 % Negative unit clauses : 1
% 23.44/17.39 % Non-unit-clauses : 0
% 23.44/17.39 % Current number of unprocessed clauses: 39
% 23.44/17.39 % ...number of literals in the above : 47
% 23.44/17.39 % Current number of archived formulas : 0
% 23.44/17.39 % Current number of archived clauses : 0
% 23.44/17.39 % Clause-clause subsumption calls (NU) : 0
% 23.44/17.39 % Rec. Clause-clause subsumption calls : 0
% 23.44/17.39 % Non-unit clause-clause subsumptions : 0
% 23.44/17.39 % Unit Clause-clause subsumption calls : 0
% 23.44/17.39 % Rewrite failures with RHS unbound : 0
% 23.44/17.39 % BW rewrite match attempts : 0
% 23.44/17.39 % BW rewrite match successes : 0
% 23.44/17.39 % Condensation attempts : 4
% 23.44/17.39 % Condensation successes : 0
% 23.44/17.39 % Termbank termtop insertions : 3677560
% 23.44/17.39 % Search garbage collected termcells : 2173859
% 23.44/17.39
% 23.44/17.39 % -------------------------------------------------
% 23.44/17.39 % User time : 2.205 s
% 23.44/17.39 % System time : 0.886 s
% 23.44/17.39 % Total time : 3.091 s
% 23.44/17.39 % Maximum resident set size: 1241624 pages
% 23.44/17.39
% 23.44/17.39 % -------------------------------------------------
% 23.44/17.39 % User time : 14.718 s
% 23.44/17.39 % System time : 1.698 s
% 23.44/17.39 % Total time : 16.417 s
% 23.44/17.39 % Maximum resident set size: 456704 pages
% 23.44/17.39 % E exiting
%------------------------------------------------------------------------------