%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR044-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:10 PM UTC 2026
% Result : Unsatisfiable 0.17s 5.75s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 21 RR)
% Number of literals : 38 ( 37 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 10 con; 0-4 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax2_7997,axiom,
ifeq4(genlmt(X1,X2),true,ifeq4(mtvisible(X1),true,mtvisible(X2),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_7997) ).
cnf(ax2_142,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_142) ).
cnf(query144,negated_conjecture,
mtvisible(c_tptp_member3633_mt) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query144) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(ax2_7920,axiom,
ifeq4(executionbyfiringsquad(X1),true,isa(X1,c_executionbyfiringsquad),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_7920) ).
cnf(ax2_19,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_19) ).
cnf(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_4288) ).
cnf(ax2_2981,axiom,
ifeq4(relationallexists(X1,X2,X3),true,ifeq4(isa(X4,X2),true,isa(f_relationallexistsfn(X4,X1,X2,X3),X3),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_2981) ).
cnf(ax2_2496,axiom,
ifeq4(mtvisible(c_cyclistsmt),true,relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_2496) ).
cnf(ax2_5730,axiom,
ifeq4(isa(X1,c_tptpcol_16_29490),true,tptpcol_16_29490(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_5730) ).
cnf(ax2_2495,axiom,
ifeq4(executionbyfiringsquad(X1),true,ifeq4(mtvisible(c_cyclistsmt),true,tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_2495) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(query144_1,negated_conjecture,
ifeq2(tuple2(tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1),tptpcol_16_29490(X1)),tuple2(true,true),a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query144_1) ).
cnf(ifeq_axiom_002,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(c_0_14,axiom,
ifeq4(genlmt(X1,X2),true,ifeq4(mtvisible(X1),true,mtvisible(X2),true),true) = true,
ax2_7997 ).
cnf(c_0_15,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt) = true,
ax2_142 ).
cnf(c_0_16,negated_conjecture,
mtvisible(c_tptp_member3633_mt) = true,
query144 ).
cnf(c_0_17,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_18,axiom,
ifeq4(executionbyfiringsquad(X1),true,isa(X1,c_executionbyfiringsquad),true) = true,
ax2_7920 ).
cnf(c_0_19,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90) = true,
ax2_19 ).
cnf(c_0_20,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt) = true,
ax2_4288 ).
cnf(c_0_21,plain,
mtvisible(c_tptp_spindleheadmt) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]),c_0_17]) ).
cnf(c_0_22,axiom,
ifeq4(relationallexists(X1,X2,X3),true,ifeq4(isa(X4,X2),true,isa(f_relationallexistsfn(X4,X1,X2,X3),X3),true),true) = true,
ax2_2981 ).
cnf(c_0_23,plain,
isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_24,axiom,
ifeq4(mtvisible(c_cyclistsmt),true,relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),true) = true,
ax2_2496 ).
cnf(c_0_25,plain,
mtvisible(c_cyclistsmt) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_17]),c_0_21]),c_0_17]) ).
cnf(c_0_26,plain,
ifeq4(relationallexists(X1,c_executionbyfiringsquad,X2),true,isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,X1,c_executionbyfiringsquad,X2),X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_27,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_17]) ).
cnf(c_0_28,axiom,
ifeq4(isa(X1,c_tptpcol_16_29490),true,tptpcol_16_29490(X1),true) = true,
ax2_5730 ).
cnf(c_0_29,plain,
isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17]) ).
cnf(c_0_30,axiom,
ifeq4(executionbyfiringsquad(X1),true,ifeq4(mtvisible(c_cyclistsmt),true,tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),true),true) = true,
ax2_2495 ).
cnf(c_0_31,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_32,negated_conjecture,
ifeq2(tuple2(tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1),tptpcol_16_29490(X1)),tuple2(true,true),a,b) = b,
query144_1 ).
cnf(c_0_33,plain,
tptpcol_16_29490(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17]) ).
cnf(c_0_34,plain,
tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_17]),c_0_25]),c_0_17]) ).
cnf(c_0_35,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_36,negated_conjecture,
a != b,
c_0_31 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR044-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.40 % Computer : n016.cluster.edu
% 0.12/5.40 % Model : x86_64 x86_64
% 0.12/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40 % Memory : 8046.5625MB
% 0.12/5.40 % OS : Linux 6.8.0-71-generic
% 0.12/5.40 % CPULimit : 300
% 0.12/5.40 % WCLimit : 300
% 0.12/5.40 % DateTime : Mon Sep 21 14:37:14 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.12/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.45 Running first-order theorem proving
% 0.12/5.45 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
% 0.17/5.75 % Version: 3.5.1
% 0.17/5.75 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.17/5.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.75 % Starting new_bool_3 with 900s (3) cores
% 0.17/5.75 % Starting new_bool_1 with 900s (3) cores
% 0.17/5.75 % Starting sh5l with 300s (1) cores
% 0.17/5.75 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.17/5.75 % new_bool_3 with pid 2672934 completed with status 0
% 0.17/5.75 % Result found by new_bool_3
% 0.17/5.75 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.17/5.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.75 % Starting new_bool_3 with 900s (3) cores
% 0.17/5.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/5.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/5.75 % Search class: FUUPM-FFMM32-MFFFFFNN
% 0.17/5.75 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.17/5.75 % Starting SubtermCWHack with 91s (1) cores
% 0.17/5.75 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 541s (1) cores
% 0.17/5.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 0.17/5.75 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2672942 completed with status 0
% 0.17/5.75 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/5.75 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.17/5.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.75 % Starting new_bool_3 with 900s (3) cores
% 0.17/5.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/5.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/5.75 % Search class: FUUPM-FFMM32-MFFFFFNN
% 0.17/5.75 % Scheduled 5 strats onto 3 cores with 900 seconds (900 total)
% 0.17/5.75 % Starting SubtermCWHack with 91s (1) cores
% 0.17/5.75 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 541s (1) cores
% 0.17/5.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 91s (1) cores
% 0.17/5.75 % Preprocessing time : 0.007 s
% 0.17/5.75 % Presaturation interreduction done
% 0.17/5.75
% 0.17/5.75 % Proof found!
% 0.17/5.75 % SZS status Unsatisfiable
% 0.17/5.75 % SZS output start CNFRefutation
% See solution above
% 0.17/5.75 % Parsed axioms : 8012
% 0.17/5.75 % Removed by relevancy pruning/SinE : 7946
% 0.17/5.75 % Initial clauses : 66
% 0.17/5.75 % Removed in clause preprocessing : 0
% 0.17/5.75 % Initial clauses in saturation : 66
% 0.17/5.75 % Processed clauses : 261
% 0.17/5.75 % ...of these trivial : 28
% 0.17/5.75 % ...subsumed : 0
% 0.17/5.75 % ...remaining for further processing : 233
% 0.17/5.75 % Other redundant clauses eliminated : 0
% 0.17/5.75 % Clauses deleted for lack of memory : 0
% 0.17/5.75 % Backward-subsumed : 0
% 0.17/5.75 % Backward-rewritten : 3
% 0.17/5.75 % Generated clauses : 487
% 0.17/5.75 % ...of the previous two non-redundant : 172
% 0.17/5.75 % ...aggressively subsumed : 0
% 0.17/5.75 % Contextual simplify-reflections : 0
% 0.17/5.75 % Paramodulations : 487
% 0.17/5.75 % Factorizations : 0
% 0.17/5.75 % NegExts : 0
% 0.17/5.75 % Equation resolutions : 0
% 0.17/5.75 % Disequality decompositions : 0
% 0.17/5.75 % Total rewrite steps : 720
% 0.17/5.75 % ...of those cached : 569
% 0.17/5.75 % Propositional unsat checks : 0
% 0.17/5.75 % Propositional check models : 0
% 0.17/5.75 % Propositional check unsatisfiable : 0
% 0.17/5.75 % Propositional clauses : 0
% 0.17/5.75 % Propositional clauses after purity: 0
% 0.17/5.75 % Propositional unsat core size : 0
% 0.17/5.75 % Propositional preprocessing time : 0.000
% 0.17/5.75 % Propositional encoding time : 0.000
% 0.17/5.75 % Propositional solver time : 0.000
% 0.17/5.75 % Success case prop preproc time : 0.000
% 0.17/5.75 % Success case prop encoding time : 0.000
% 0.17/5.75 % Success case prop solver time : 0.000
% 0.17/5.75 % Current number of processed clauses : 182
% 0.17/5.75 % Positive orientable unit clauses : 181
% 0.17/5.75 % Positive unorientable unit clauses: 0
% 0.17/5.75 % Negative unit clauses : 1
% 0.17/5.75 % Non-unit-clauses : 0
% 0.17/5.75 % Current number of unprocessed clauses: 25
% 0.17/5.75 % ...number of literals in the above : 25
% 0.17/5.75 % Current number of archived formulas : 0
% 0.17/5.75 % Current number of archived clauses : 51
% 0.17/5.75 % Clause-clause subsumption calls (NU) : 0
% 0.17/5.75 % Rec. Clause-clause subsumption calls : 0
% 0.17/5.75 % Non-unit clause-clause subsumptions : 0
% 0.17/5.75 % Unit Clause-clause subsumption calls : 0
% 0.17/5.75 % Rewrite failures with RHS unbound : 0
% 0.17/5.75 % BW rewrite match attempts : 312
% 0.17/5.75 % BW rewrite match successes : 2
% 0.17/5.75 % Condensation attempts : 0
% 0.17/5.75 % Condensation successes : 0
% 0.17/5.75 % Termbank termtop insertions : 65768
% 0.17/5.75 % Search garbage collected termcells : 23320
% 0.17/5.75
% 0.17/5.75 % -------------------------------------------------
% 0.17/5.75 % User time : 0.054 s
% 0.17/5.75 % System time : 0.037 s
% 0.17/5.75 % Total time : 0.091 s
% 0.17/5.75 % Maximum resident set size: 19204 pages
% 0.17/5.75
% 0.17/5.75 % -------------------------------------------------
% 0.17/5.75 % User time : 0.217 s
% 0.17/5.75 % System time : 0.102 s
% 0.17/5.75 % Total time : 0.319 s
% 0.17/5.75 % Maximum resident set size: 10496 pages
% 0.17/5.75 % E exiting
%------------------------------------------------------------------------------