%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR044+1 : 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 : n014.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 : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 65 ( 28 ~; 23 |; 6 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 34 ( 0 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query44,conjecture,
? [X13] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptpcol_16_29490(X13)
& tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query44) ).
fof(just48,axiom,
! [X19,X20] :
( ( genlmt(X19,X20)
& mtvisible(X19) )
=> mtvisible(X20) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just48) ).
fof(just9,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just9) ).
fof(just31,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_29490)
=> tptpcol_16_29490(X13) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just31) ).
fof(just10,axiom,
! [X1] :
( ( executionbyfiringsquad(X1)
& mtvisible(c_cyclistsmt) )
=> tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just10) ).
fof(just8,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just8) ).
fof(just11,axiom,
( mtvisible(c_cyclistsmt)
=> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).
fof(just1,axiom,
! [X1,X2,X3,X4] :
( ( relationallexists(X3,X2,X4)
& isa(X1,X2) )
=> isa(f_relationallexistsfn(X1,X3,X2,X4),X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
fof(just34,axiom,
! [X13] :
( executionbyfiringsquad(X13)
=> isa(X13,c_executionbyfiringsquad) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just34) ).
fof(just12,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just12) ).
fof(c_0_10,negated_conjecture,
~ ? [X13] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptpcol_16_29490(X13)
& tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13) ) ),
inference(assume_negation,[status(cth)],[query44]) ).
fof(c_0_11,plain,
! [X98,X99] :
( mtvisible(X99)
| ~ genlmt(X98,X99)
| ~ mtvisible(X98) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just48])])]) ).
fof(c_0_12,negated_conjecture,
! [X141] :
( ( ~ tptpcol_16_29490(X141)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X141) )
& mtvisible(c_tptp_member3633_mt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_13,plain,
( ~ genlmt(X1,X2)
| ~ mtvisible(X1)
| mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just9]) ).
cnf(c_0_15,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X68] :
( tptpcol_16_29490(X68)
| ~ isa(X68,c_tptpcol_16_29490) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just31])])]) ).
fof(c_0_17,plain,
! [X26] :
( tptp_9_720(X26,f_relationallexistsfn(X26,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ executionbyfiringsquad(X26)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just10])])]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[just8]) ).
cnf(c_0_19,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_20,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])]) ).
cnf(c_0_21,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ isa(X1,c_tptpcol_16_29490)
| tptpcol_16_29490(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ executionbyfiringsquad(X1)
| ~ mtvisible(c_cyclistsmt)
| tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19])]) ).
fof(c_0_25,plain,
! [X22,X23,X24,X25] :
( isa(f_relationallexistsfn(X22,X24,X23,X25),X25)
| ~ relationallexists(X24,X23,X25)
| ~ isa(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just1])])]) ).
cnf(c_0_26,plain,
( ~ mtvisible(c_cyclistsmt)
| relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X71] :
( isa(X71,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X71) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just34])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ isa(X1,c_tptpcol_16_29490)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ executionbyfiringsquad(X1)
| tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_30,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
inference(split_conjunct,[status(thm)],[just12]) ).
cnf(c_0_31,plain,
( ~ relationallexists(X3,X2,X4)
| ~ isa(X1,X2)
| isa(f_relationallexistsfn(X1,X3,X2,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]) ).
cnf(c_0_33,plain,
( ~ executionbyfiringsquad(X1)
| isa(X1,c_executionbyfiringsquad) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
~ isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,plain,
( ~ isa(X1,c_executionbyfiringsquad)
| isa(f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR044+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 14:32:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 116342 completed with status 0
% 0.13/0.43 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FHHNM-FFMM33-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.43 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 116350 completed with status 0
% 0.13/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.13/0.43 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.43 % No SInE strategy applied
% 0.13/0.43 % Search class: FHHNM-FFMM33-SFFFFFNN
% 0.13/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.43 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43 % Presaturation interreduction done
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 65
% 0.13/0.43 % Removed by relevancy pruning/SinE : 0
% 0.13/0.43 % Initial clauses : 66
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 66
% 0.13/0.43 % Processed clauses : 193
% 0.13/0.43 % ...of these trivial : 6
% 0.13/0.43 % ...subsumed : 17
% 0.13/0.43 % ...remaining for further processing : 170
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 1
% 0.13/0.43 % Generated clauses : 156
% 0.13/0.43 % ...of the previous two non-redundant : 82
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 0
% 0.13/0.43 % Paramodulations : 156
% 0.13/0.43 % Factorizations : 0
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 92
% 0.13/0.43 % ...of those cached : 68
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 111
% 0.13/0.43 % Positive orientable unit clauses : 54
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 1
% 0.13/0.43 % Non-unit-clauses : 56
% 0.13/0.43 % Current number of unprocessed clauses: 11
% 0.13/0.43 % ...number of literals in the above : 26
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 59
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 1024
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 881
% 0.13/0.43 % Non-unit clause-clause subsumptions : 17
% 0.13/0.43 % Unit Clause-clause subsumption calls : 94
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 1
% 0.13/0.43 % BW rewrite match successes : 1
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 5429
% 0.13/0.43 % Search garbage collected termcells : 595
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.006 s
% 0.13/0.43 % System time : 0.006 s
% 0.13/0.43 % Total time : 0.012 s
% 0.13/0.43 % Maximum resident set size: 3700 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.015 s
% 0.13/0.43 % System time : 0.017 s
% 0.13/0.43 % Total time : 0.032 s
% 0.13/0.43 % Maximum resident set size: 4864 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------