TSTP Solution File: CSR044+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR044+4 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 27.43s 27.08s
% Output : CNFRefutation 27.43s
% 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(query194,conjecture,
? [X16] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X16)
& tptpcol_16_29490(X16) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',query194) ).
fof(ax3_44208,axiom,
! [X22,X23] :
( ( mtvisible(X22)
& genlmt(X22,X23) )
=> mtvisible(X23) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_44208) ).
fof(ax3_10983,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_10983) ).
fof(ax3_35879,axiom,
! [X16] :
( isa(X16,c_tptpcol_16_29490)
=> tptpcol_16_29490(X16) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_35879) ).
fof(ax3_14922,axiom,
! [X5] :
( ( mtvisible(c_cyclistsmt)
& executionbyfiringsquad(X5) )
=> tptp_9_720(X5,f_relationallexistsfn(X5,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_14922) ).
fof(ax3_86,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_86) ).
fof(ax3_14923,axiom,
( mtvisible(c_cyclistsmt)
=> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_14923) ).
fof(ax3_44118,axiom,
! [X16] :
( executionbyfiringsquad(X16)
=> isa(X16,c_executionbyfiringsquad) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_44118) ).
fof(ax3_51,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_51) ).
fof(ax3_14126,axiom,
! [X5,X9,X10,X11] :
( ( isa(X5,X9)
& relationallexists(X10,X9,X11) )
=> isa(f_relationallexistsfn(X5,X10,X9,X11),X11) ),
file('/export/starexec/sandbox2/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p',ax3_14126) ).
fof(c_0_10,negated_conjecture,
~ ? [X16] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X16)
& tptpcol_16_29490(X16) ) ),
inference(assume_negation,[status(cth)],[query194]) ).
fof(c_0_11,plain,
! [X29,X30] :
( ~ mtvisible(X29)
| ~ genlmt(X29,X30)
| mtvisible(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).
fof(c_0_12,negated_conjecture,
! [X24] :
( mtvisible(c_tptp_member3633_mt)
& ( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X24)
| ~ tptpcol_16_29490(X24) ) ),
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)],[ax3_10983]) ).
cnf(c_0_15,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X25] :
( ~ isa(X25,c_tptpcol_16_29490)
| tptpcol_16_29490(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_35879])])]) ).
fof(c_0_17,plain,
! [X31] :
( ~ mtvisible(c_cyclistsmt)
| ~ executionbyfiringsquad(X31)
| tptp_9_720(X31,f_relationallexistsfn(X31,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)],[ax3_14922])])]) ).
cnf(c_0_18,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax3_86]) ).
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)],[ax3_14923])]) ).
fof(c_0_25,plain,
! [X57] :
( ~ executionbyfiringsquad(X57)
| isa(X57,c_executionbyfiringsquad) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44118])])]) ).
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)],[ax3_51]) ).
fof(c_0_29,plain,
! [X36,X37,X38,X39] :
( ~ isa(X36,X37)
| ~ relationallexists(X38,X37,X39)
| isa(f_relationallexistsfn(X36,X38,X37,X39),X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_14126])])]) ).
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
% 13.20/13.24 % Problem : CSR044+4 : TPTP v8.1.2. Released v3.4.0.
% 13.20/13.25 % Command : run_E %s %d THM
% 13.25/13.46 % Computer : n021.cluster.edu
% 13.25/13.46 % Model : x86_64 x86_64
% 13.25/13.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 13.25/13.46 % Memory : 8042.1875MB
% 13.25/13.46 % OS : Linux 3.10.0-693.el7.x86_64
% 13.25/13.47 % CPULimit : 300
% 13.25/13.47 % WCLimit : 300
% 13.25/13.47 % DateTime : Fri May 3 15:20:21 EDT 2024
% 13.25/13.47 % CPUTime :
% 26.33/26.50 Running first-order theorem proving
% 26.33/26.50 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/tmp/tmp.cSsUzkYkLm/E---3.1_12880.p
% 27.43/27.08 # Version: 3.1.0
% 27.43/27.08 # Preprocessing class: FMLLLMSLSSSNFFN.
% 27.43/27.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.43/27.08 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 27.43/27.08 # Starting new_bool_3 with 300s (1) cores
% 27.43/27.08 # Starting new_bool_1 with 300s (1) cores
% 27.43/27.08 # Starting sh5l with 300s (1) cores
% 27.43/27.08 # new_bool_3 with pid 12959 completed with status 0
% 27.43/27.08 # Result found by new_bool_3
% 27.43/27.08 # Preprocessing class: FMLLLMSLSSSNFFN.
% 27.43/27.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.43/27.08 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 27.43/27.08 # Starting new_bool_3 with 300s (1) cores
% 27.43/27.08 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 27.43/27.08 # Search class: FHHNS-FFSM33-SFFFFFNN
% 27.43/27.08 # partial match(2): FHHNM-FFMM33-SFFFFFNN
% 27.43/27.08 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 27.43/27.08 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 27.43/27.08 # SAT001_MinMin_p005000_rr_RG with pid 12963 completed with status 0
% 27.43/27.08 # Result found by SAT001_MinMin_p005000_rr_RG
% 27.43/27.08 # Preprocessing class: FMLLLMSLSSSNFFN.
% 27.43/27.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.43/27.08 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 27.43/27.08 # Starting new_bool_3 with 300s (1) cores
% 27.43/27.08 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 27.43/27.08 # Search class: FHHNS-FFSM33-SFFFFFNN
% 27.43/27.08 # partial match(2): FHHNM-FFMM33-SFFFFFNN
% 27.43/27.08 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 27.43/27.08 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 27.43/27.08 # Preprocessing time : 0.012 s
% 27.43/27.08 # Presaturation interreduction done
% 27.43/27.08
% 27.43/27.08 # Proof found!
% 27.43/27.08 # SZS status Theorem
% 27.43/27.08 # SZS output start CNFRefutation
% See solution above
% 27.43/27.08 # Parsed axioms : 44217
% 27.43/27.08 # Removed by relevancy pruning/SinE : 44186
% 27.43/27.08 # Initial clauses : 32
% 27.43/27.08 # Removed in clause preprocessing : 0
% 27.43/27.08 # Initial clauses in saturation : 32
% 27.43/27.08 # Processed clauses : 66
% 27.43/27.08 # ...of these trivial : 3
% 27.43/27.08 # ...subsumed : 3
% 27.43/27.08 # ...remaining for further processing : 60
% 27.43/27.08 # Other redundant clauses eliminated : 0
% 27.43/27.08 # Clauses deleted for lack of memory : 0
% 27.43/27.08 # Backward-subsumed : 0
% 27.43/27.08 # Backward-rewritten : 1
% 27.43/27.08 # Generated clauses : 25
% 27.43/27.08 # ...of the previous two non-redundant : 17
% 27.43/27.08 # ...aggressively subsumed : 0
% 27.43/27.08 # Contextual simplify-reflections : 0
% 27.43/27.08 # Paramodulations : 25
% 27.43/27.08 # Factorizations : 0
% 27.43/27.08 # NegExts : 0
% 27.43/27.08 # Equation resolutions : 0
% 27.43/27.08 # Disequality decompositions : 0
% 27.43/27.08 # Total rewrite steps : 16
% 27.43/27.08 # ...of those cached : 7
% 27.43/27.08 # Propositional unsat checks : 0
% 27.43/27.08 # Propositional check models : 0
% 27.43/27.08 # Propositional check unsatisfiable : 0
% 27.43/27.08 # Propositional clauses : 0
% 27.43/27.08 # Propositional clauses after purity: 0
% 27.43/27.08 # Propositional unsat core size : 0
% 27.43/27.08 # Propositional preprocessing time : 0.000
% 27.43/27.08 # Propositional encoding time : 0.000
% 27.43/27.08 # Propositional solver time : 0.000
% 27.43/27.08 # Success case prop preproc time : 0.000
% 27.43/27.08 # Success case prop encoding time : 0.000
% 27.43/27.08 # Success case prop solver time : 0.000
% 27.43/27.08 # Current number of processed clauses : 33
% 27.43/27.08 # Positive orientable unit clauses : 19
% 27.43/27.08 # Positive unorientable unit clauses: 0
% 27.43/27.08 # Negative unit clauses : 1
% 27.43/27.08 # Non-unit-clauses : 13
% 27.43/27.08 # Current number of unprocessed clauses: 7
% 27.43/27.08 # ...number of literals in the above : 14
% 27.43/27.08 # Current number of archived formulas : 0
% 27.43/27.08 # Current number of archived clauses : 27
% 27.43/27.08 # Clause-clause subsumption calls (NU) : 54
% 27.43/27.08 # Rec. Clause-clause subsumption calls : 44
% 27.43/27.08 # Non-unit clause-clause subsumptions : 3
% 27.43/27.08 # Unit Clause-clause subsumption calls : 1
% 27.43/27.08 # Rewrite failures with RHS unbound : 0
% 27.43/27.08 # BW rewrite match attempts : 1
% 27.43/27.08 # BW rewrite match successes : 1
% 27.43/27.08 # Condensation attempts : 0
% 27.43/27.08 # Condensation successes : 0
% 27.43/27.08 # Termbank termtop insertions : 293294
% 27.43/27.08 # Search garbage collected termcells : 157729
% 27.43/27.08
% 27.43/27.08 # -------------------------------------------------
% 27.43/27.08 # User time : 0.146 s
% 27.43/27.08 # System time : 0.067 s
% 27.43/27.08 # Total time : 0.213 s
% 27.43/27.08 # Maximum resident set size: 81612 pages
% 27.43/27.08
% 27.43/27.08 # -------------------------------------------------
% 27.43/27.08 # User time : 0.445 s
% 27.43/27.08 # System time : 0.094 s
% 27.43/27.08 # Total time : 0.540 s
% 27.43/27.08 # Maximum resident set size: 34596 pages
% 27.43/27.08 % E---3.1 exiting
% 27.43/27.08 % E exiting
%------------------------------------------------------------------------------