%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR051-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 : Unsatisfiable 0.47s 0.63s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 9 RR)
% Number of literals : 15 ( 14 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 14 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax2_395,axiom,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2_395) ).
cnf(query151,negated_conjecture,
mtvisible(c_tptp_member3356_mt) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(query151_1,negated_conjecture,
ifeq3(marriagelicensedocument(X1),true,a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151_1) ).
cnf(ifeq_axiom_001,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(c_0_6,axiom,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
ax2_395 ).
cnf(c_0_7,negated_conjecture,
mtvisible(c_tptp_member3356_mt) = true,
query151 ).
cnf(c_0_8,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_9,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_10,negated_conjecture,
ifeq3(marriagelicensedocument(X1),true,a,b) = b,
query151_1 ).
cnf(c_0_11,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_12,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_13,negated_conjecture,
a != b,
c_0_9 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR051-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 14:36:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.47/0.63 % Version: 3.5.1
% 0.47/0.63 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.47/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.63 % Starting new_bool_3 with 900s (3) cores
% 0.47/0.63 % Starting new_bool_1 with 900s (3) cores
% 0.47/0.63 % Starting sh5l with 300s (1) cores
% 0.47/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.47/0.63 % new_bool_3 with pid 3740184 completed with status 0
% 0.47/0.63 % Result found by new_bool_3
% 0.47/0.63 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.47/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.63 % Starting new_bool_3 with 900s (3) cores
% 0.47/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.47/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.63 % Search class: FUUPM-FFMM31-MFFFFFNN
% 0.47/0.63 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.47/0.63 % Starting SubtermCWHack with 91s (1) cores
% 0.47/0.63 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 541s (1) cores
% 0.47/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 0.47/0.63 % SubtermCWHack with pid 3740200 completed with status 0
% 0.47/0.63 % Result found by SubtermCWHack
% 0.47/0.63 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.47/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.63 % Starting new_bool_3 with 900s (3) cores
% 0.47/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.47/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.63 % Search class: FUUPM-FFMM31-MFFFFFNN
% 0.47/0.63 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.47/0.63 % Starting SubtermCWHack with 91s (1) cores
% 0.47/0.63 % Preprocessing time : 0.008 s
% 0.47/0.63
% 0.47/0.63 % Proof found!
% 0.47/0.63 % SZS status Unsatisfiable
% 0.47/0.63 % SZS output start CNFRefutation
% See solution above
% 0.47/0.63 % Parsed axioms : 8012
% 0.47/0.63 % Removed by relevancy pruning/SinE : 7984
% 0.47/0.63 % Initial clauses : 28
% 0.47/0.63 % Removed in clause preprocessing : 0
% 0.47/0.63 % Initial clauses in saturation : 28
% 0.47/0.63 % Processed clauses : 14
% 0.47/0.63 % ...of these trivial : 1
% 0.47/0.63 % ...subsumed : 0
% 0.47/0.63 % ...remaining for further processing : 13
% 0.47/0.63 % Other redundant clauses eliminated : 0
% 0.47/0.63 % Clauses deleted for lack of memory : 0
% 0.47/0.63 % Backward-subsumed : 0
% 0.47/0.63 % Backward-rewritten : 0
% 0.47/0.63 % Generated clauses : 1
% 0.47/0.63 % ...of the previous two non-redundant : 0
% 0.47/0.63 % ...aggressively subsumed : 0
% 0.47/0.63 % Contextual simplify-reflections : 0
% 0.47/0.63 % Paramodulations : 1
% 0.47/0.63 % Factorizations : 0
% 0.47/0.63 % NegExts : 0
% 0.47/0.63 % Equation resolutions : 0
% 0.47/0.63 % Disequality decompositions : 0
% 0.47/0.63 % Total rewrite steps : 4
% 0.47/0.63 % ...of those cached : 0
% 0.47/0.63 % Propositional unsat checks : 0
% 0.47/0.63 % Propositional check models : 0
% 0.47/0.63 % Propositional check unsatisfiable : 0
% 0.47/0.63 % Propositional clauses : 0
% 0.47/0.63 % Propositional clauses after purity: 0
% 0.47/0.63 % Propositional unsat core size : 0
% 0.47/0.63 % Propositional preprocessing time : 0.000
% 0.47/0.63 % Propositional encoding time : 0.000
% 0.47/0.63 % Propositional solver time : 0.000
% 0.47/0.63 % Success case prop preproc time : 0.000
% 0.47/0.63 % Success case prop encoding time : 0.000
% 0.47/0.63 % Success case prop solver time : 0.000
% 0.47/0.63 % Current number of processed clauses : 13
% 0.47/0.63 % Positive orientable unit clauses : 12
% 0.47/0.63 % Positive unorientable unit clauses: 0
% 0.47/0.63 % Negative unit clauses : 1
% 0.47/0.63 % Non-unit-clauses : 0
% 0.47/0.63 % Current number of unprocessed clauses: 14
% 0.47/0.63 % ...number of literals in the above : 14
% 0.47/0.63 % Current number of archived formulas : 0
% 0.47/0.63 % Current number of archived clauses : 0
% 0.47/0.63 % Clause-clause subsumption calls (NU) : 0
% 0.47/0.63 % Rec. Clause-clause subsumption calls : 0
% 0.47/0.63 % Non-unit clause-clause subsumptions : 0
% 0.47/0.63 % Unit Clause-clause subsumption calls : 0
% 0.47/0.63 % Rewrite failures with RHS unbound : 0
% 0.47/0.63 % BW rewrite match attempts : 0
% 0.47/0.63 % BW rewrite match successes : 0
% 0.47/0.63 % Condensation attempts : 0
% 0.47/0.63 % Condensation successes : 0
% 0.47/0.63 % Termbank termtop insertions : 58404
% 0.47/0.63 % Search garbage collected termcells : 23401
% 0.47/0.63
% 0.47/0.63 % -------------------------------------------------
% 0.47/0.63 % User time : 0.036 s
% 0.47/0.63 % System time : 0.027 s
% 0.47/0.63 % Total time : 0.063 s
% 0.47/0.63 % Maximum resident set size: 19460 pages
% 0.47/0.63
% 0.47/0.63 % -------------------------------------------------
% 0.47/0.63 % User time : 0.162 s
% 0.47/0.63 % System time : 0.055 s
% 0.47/0.63 % Total time : 0.218 s
% 0.47/0.63 % Maximum resident set size: 10496 pages
% 0.47/0.63 % E exiting
%------------------------------------------------------------------------------