TSTP Solution File: CSR044+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR044+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:31:38 EDT 2024
% Result : Theorem 1.84s 1.83s
% Output : CNFRefutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 63 ( 27 ~; 22 |; 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 : 33 ( 0 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query144,conjecture,
? [X15] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X15)
& tptpcol_16_29490(X15) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',query144) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_7997) ).
fof(ax2_142,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_142) ).
fof(ax2_5730,axiom,
! [X15] :
( isa(X15,c_tptpcol_16_29490)
=> tptpcol_16_29490(X15) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_5730) ).
fof(ax2_2495,axiom,
! [X7] :
( ( mtvisible(c_cyclistsmt)
& executionbyfiringsquad(X7) )
=> tptp_9_720(X7,f_relationallexistsfn(X7,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_2495) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_4288) ).
fof(ax2_2496,axiom,
( mtvisible(c_cyclistsmt)
=> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_2496) ).
fof(ax2_7920,axiom,
! [X15] :
( executionbyfiringsquad(X15)
=> isa(X15,c_executionbyfiringsquad) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_7920) ).
fof(ax2_19,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_19) ).
fof(ax2_2981,axiom,
! [X7,X8,X9,X10] :
( ( isa(X7,X8)
& relationallexists(X9,X8,X10) )
=> isa(f_relationallexistsfn(X7,X9,X8,X10),X10) ),
file('/export/starexec/sandbox/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p',ax2_2981) ).
fof(c_0_10,negated_conjecture,
~ ? [X15] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X15)
& tptpcol_16_29490(X15) ) ),
inference(assume_negation,[status(cth)],[query144]) ).
fof(c_0_11,plain,
! [X28,X29] :
( ~ mtvisible(X28)
| ~ genlmt(X28,X29)
| mtvisible(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
fof(c_0_12,negated_conjecture,
! [X23] :
( mtvisible(c_tptp_member3633_mt)
& ( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X23)
| ~ tptpcol_16_29490(X23) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_13,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,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)],[ax2_142]) ).
cnf(c_0_15,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X24] :
( ~ isa(X24,c_tptpcol_16_29490)
| tptpcol_16_29490(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_5730])])]) ).
fof(c_0_17,plain,
! [X30] :
( ~ mtvisible(c_cyclistsmt)
| ~ executionbyfiringsquad(X30)
| tptp_9_720(X30,f_relationallexistsfn(X30,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2495])])]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
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])]) ).
cnf(c_0_20,negated_conjecture,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)
| ~ tptpcol_16_29490(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ mtvisible(c_cyclistsmt)
| ~ executionbyfiringsquad(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,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_24,plain,
( ~ mtvisible(c_cyclistsmt)
| relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2496])]) ).
fof(c_0_25,plain,
! [X33] :
( ~ executionbyfiringsquad(X33)
| isa(X33,c_executionbyfiringsquad) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7920])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ executionbyfiringsquad(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
inference(split_conjunct,[status(thm)],[ax2_19]) ).
fof(c_0_29,plain,
! [X37,X38,X39,X40] :
( ~ isa(X37,X38)
| ~ relationallexists(X39,X38,X40)
| isa(f_relationallexistsfn(X37,X39,X38,X40),X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2981])])]) ).
cnf(c_0_30,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,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_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
( isa(f_relationallexistsfn(X1,X3,X2,X4),X4)
| ~ isa(X1,X2)
| ~ relationallexists(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_23])]) ).
cnf(c_0_35,plain,
isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.72/0.75 % Problem : CSR044+3 : TPTP v8.1.2. Released v3.4.0.
% 0.77/0.76 % Command : run_E %s %d THM
% 0.77/0.97 % Computer : n028.cluster.edu
% 0.77/0.97 % Model : x86_64 x86_64
% 0.77/0.97 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.77/0.97 % Memory : 8042.1875MB
% 0.77/0.97 % OS : Linux 3.10.0-693.el7.x86_64
% 0.77/0.97 % CPULimit : 300
% 0.77/0.97 % WCLimit : 300
% 0.77/0.97 % DateTime : Fri May 3 14:57:53 EDT 2024
% 0.77/0.97 % CPUTime :
% 1.50/1.71 Running first-order theorem proving
% 1.50/1.71 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/tmp/tmp.ZqlnQRjMOQ/E---3.1_3834.p
% 1.84/1.83 # Version: 3.1.0
% 1.84/1.83 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.84/1.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/1.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.84/1.83 # Starting new_bool_3 with 300s (1) cores
% 1.84/1.83 # Starting new_bool_1 with 300s (1) cores
% 1.84/1.83 # Starting sh5l with 300s (1) cores
% 1.84/1.83 # new_bool_1 with pid 4010 completed with status 0
% 1.84/1.83 # Result found by new_bool_1
% 1.84/1.83 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.84/1.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/1.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.84/1.83 # Starting new_bool_3 with 300s (1) cores
% 1.84/1.83 # Starting new_bool_1 with 300s (1) cores
% 1.84/1.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.84/1.83 # Search class: FHHNS-FFSM33-SFFFFFNN
% 1.84/1.83 # partial match(2): FHHNM-FFMM33-SFFFFFNN
% 1.84/1.83 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.84/1.83 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.84/1.83 # SAT001_MinMin_p005000_rr_RG with pid 4013 completed with status 0
% 1.84/1.83 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.84/1.83 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.84/1.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.84/1.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.84/1.83 # Starting new_bool_3 with 300s (1) cores
% 1.84/1.83 # Starting new_bool_1 with 300s (1) cores
% 1.84/1.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.84/1.83 # Search class: FHHNS-FFSM33-SFFFFFNN
% 1.84/1.83 # partial match(2): FHHNM-FFMM33-SFFFFFNN
% 1.84/1.83 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.84/1.83 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.84/1.83 # Preprocessing time : 0.006 s
% 1.84/1.83 # Presaturation interreduction done
% 1.84/1.83
% 1.84/1.83 # Proof found!
% 1.84/1.83 # SZS status Theorem
% 1.84/1.83 # SZS output start CNFRefutation
% See solution above
% 1.84/1.83 # Parsed axioms : 8006
% 1.84/1.83 # Removed by relevancy pruning/SinE : 7975
% 1.84/1.83 # Initial clauses : 32
% 1.84/1.83 # Removed in clause preprocessing : 0
% 1.84/1.83 # Initial clauses in saturation : 32
% 1.84/1.83 # Processed clauses : 66
% 1.84/1.83 # ...of these trivial : 3
% 1.84/1.83 # ...subsumed : 3
% 1.84/1.83 # ...remaining for further processing : 60
% 1.84/1.83 # Other redundant clauses eliminated : 0
% 1.84/1.83 # Clauses deleted for lack of memory : 0
% 1.84/1.83 # Backward-subsumed : 0
% 1.84/1.83 # Backward-rewritten : 1
% 1.84/1.83 # Generated clauses : 25
% 1.84/1.83 # ...of the previous two non-redundant : 17
% 1.84/1.83 # ...aggressively subsumed : 0
% 1.84/1.83 # Contextual simplify-reflections : 0
% 1.84/1.83 # Paramodulations : 25
% 1.84/1.83 # Factorizations : 0
% 1.84/1.83 # NegExts : 0
% 1.84/1.83 # Equation resolutions : 0
% 1.84/1.83 # Disequality decompositions : 0
% 1.84/1.83 # Total rewrite steps : 16
% 1.84/1.83 # ...of those cached : 7
% 1.84/1.83 # Propositional unsat checks : 0
% 1.84/1.83 # Propositional check models : 0
% 1.84/1.83 # Propositional check unsatisfiable : 0
% 1.84/1.83 # Propositional clauses : 0
% 1.84/1.83 # Propositional clauses after purity: 0
% 1.84/1.83 # Propositional unsat core size : 0
% 1.84/1.83 # Propositional preprocessing time : 0.000
% 1.84/1.83 # Propositional encoding time : 0.000
% 1.84/1.83 # Propositional solver time : 0.000
% 1.84/1.83 # Success case prop preproc time : 0.000
% 1.84/1.83 # Success case prop encoding time : 0.000
% 1.84/1.83 # Success case prop solver time : 0.000
% 1.84/1.83 # Current number of processed clauses : 33
% 1.84/1.83 # Positive orientable unit clauses : 19
% 1.84/1.83 # Positive unorientable unit clauses: 0
% 1.84/1.83 # Negative unit clauses : 1
% 1.84/1.83 # Non-unit-clauses : 13
% 1.84/1.83 # Current number of unprocessed clauses: 7
% 1.84/1.83 # ...number of literals in the above : 14
% 1.84/1.83 # Current number of archived formulas : 0
% 1.84/1.83 # Current number of archived clauses : 27
% 1.84/1.83 # Clause-clause subsumption calls (NU) : 26
% 1.84/1.83 # Rec. Clause-clause subsumption calls : 23
% 1.84/1.83 # Non-unit clause-clause subsumptions : 3
% 1.84/1.83 # Unit Clause-clause subsumption calls : 2
% 1.84/1.83 # Rewrite failures with RHS unbound : 0
% 1.84/1.83 # BW rewrite match attempts : 1
% 1.84/1.83 # BW rewrite match successes : 1
% 1.84/1.83 # Condensation attempts : 0
% 1.84/1.83 # Condensation successes : 0
% 1.84/1.83 # Termbank termtop insertions : 52475
% 1.84/1.83 # Search garbage collected termcells : 31083
% 1.84/1.83
% 1.84/1.83 # -------------------------------------------------
% 1.84/1.83 # User time : 0.034 s
% 1.84/1.83 # System time : 0.018 s
% 1.84/1.83 # Total time : 0.052 s
% 1.84/1.83 # Maximum resident set size: 18160 pages
% 1.84/1.83
% 1.84/1.83 # -------------------------------------------------
% 1.84/1.83 # User time : 0.080 s
% 1.84/1.83 # System time : 0.024 s
% 1.84/1.83 # Total time : 0.104 s
% 1.84/1.83 # Maximum resident set size: 8068 pages
% 1.84/1.83 % E---3.1 exiting
% 1.84/1.83 % E exiting
%------------------------------------------------------------------------------