TSTP Solution File: CSR044+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 : 600s
% DateTime : Fri Jul 15 03:01:44 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 13 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 29 ~; 24 |; 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)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13)
& tptpcol_16_29490(X13) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query44) ).
fof(just48,axiom,
! [X19,X20] :
( ( mtvisible(X19)
& genlmt(X19,X20) )
=> mtvisible(X20) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just48) ).
fof(just8,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just8) ).
fof(just9,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just9) ).
fof(just31,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_29490)
=> tptpcol_16_29490(X13) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just31) ).
fof(just10,axiom,
! [X1] :
( ( mtvisible(c_cyclistsmt)
& executionbyfiringsquad(X1) )
=> tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just10) ).
fof(just11,axiom,
( mtvisible(c_cyclistsmt)
=> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just11) ).
fof(just1,axiom,
! [X1,X2,X3,X4] :
( ( isa(X1,X2)
& relationallexists(X3,X2,X4) )
=> isa(f_relationallexistsfn(X1,X3,X2,X4),X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just1) ).
fof(just34,axiom,
! [X13] :
( executionbyfiringsquad(X13)
=> isa(X13,c_executionbyfiringsquad) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just34) ).
fof(just12,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just12) ).
fof(c_0_10,negated_conjecture,
~ ? [X13] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13)
& tptpcol_16_29490(X13) ) ),
inference(assume_negation,[status(cth)],[query44]) ).
fof(c_0_11,plain,
! [X21,X22] :
( ~ mtvisible(X21)
| ~ genlmt(X21,X22)
| mtvisible(X22) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just48])]) ).
fof(c_0_12,negated_conjecture,
! [X14] :
( mtvisible(c_tptp_member3633_mt)
& ( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X14)
| ~ tptpcol_16_29490(X14) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_13,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[just8]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just9]) ).
cnf(c_0_16,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X14] :
( ~ isa(X14,c_tptpcol_16_29490)
| tptpcol_16_29490(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just31])]) ).
fof(c_0_18,plain,
! [X2] :
( ~ mtvisible(c_cyclistsmt)
| ~ executionbyfiringsquad(X2)
| tptp_9_720(X2,f_relationallexistsfn(X2,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just10])]) ).
cnf(c_0_19,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_16])]) ).
fof(c_0_21,plain,
( ~ mtvisible(c_cyclistsmt)
| relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
inference(fof_nnf,[status(thm)],[just11]) ).
cnf(c_0_22,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ executionbyfiringsquad(X1)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
fof(c_0_26,plain,
! [X5,X6,X7,X8] :
( ~ isa(X5,X6)
| ~ relationallexists(X7,X6,X8)
| isa(f_relationallexistsfn(X5,X7,X6,X8),X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just1])]) ).
cnf(c_0_27,plain,
( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X14] :
( ~ executionbyfiringsquad(X14)
| isa(X14,c_executionbyfiringsquad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just34])]) ).
cnf(c_0_29,negated_conjecture,
( ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,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_24,c_0_25])]) ).
cnf(c_0_31,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
inference(split_conjunct,[status(thm)],[just12]) ).
cnf(c_0_32,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ relationallexists(X2,X3,X4)
| ~ isa(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_25])]) ).
cnf(c_0_34,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,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_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( isa(f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490)
| ~ isa(X1,c_executionbyfiringsquad) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 10 07:08:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.015 s
% 0.24/1.41
% 0.24/1.41 # Failure: Out of unprocessed clauses!
% 0.24/1.41 # OLD status GaveUp
% 0.24/1.41 # Parsed axioms : 65
% 0.24/1.41 # Removed by relevancy pruning/SinE : 54
% 0.24/1.41 # Initial clauses : 12
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 12
% 0.24/1.41 # Processed clauses : 18
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 0
% 0.24/1.41 # ...remaining for further processing : 18
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 0
% 0.24/1.41 # Generated clauses : 9
% 0.24/1.41 # ...of the previous two non-trivial : 6
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 9
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 18
% 0.24/1.41 # Positive orientable unit clauses : 7
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 0
% 0.24/1.41 # Non-unit-clauses : 11
% 0.24/1.41 # Current number of unprocessed clauses: 0
% 0.24/1.41 # ...number of literals in the above : 0
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 0
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 3
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 3
% 0.24/1.41 # Non-unit clause-clause subsumptions : 0
% 0.24/1.41 # Unit Clause-clause subsumption calls : 0
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 0
% 0.24/1.41 # BW rewrite match successes : 0
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1045
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.011 s
% 0.24/1.41 # System time : 0.004 s
% 0.24/1.41 # Total time : 0.015 s
% 0.24/1.41 # Maximum resident set size: 2784 pages
% 0.24/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.016 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 39
% 0.24/1.41 # Proof object clause steps : 21
% 0.24/1.41 # Proof object formula steps : 18
% 0.24/1.41 # Proof object conjectures : 8
% 0.24/1.41 # Proof object clause conjectures : 5
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 11
% 0.24/1.41 # Proof object initial formulas used : 10
% 0.24/1.41 # Proof object generating inferences : 7
% 0.24/1.41 # Proof object simplifying inferences : 12
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 65
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 66
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 66
% 0.24/1.41 # Processed clauses : 129
% 0.24/1.41 # ...of these trivial : 6
% 0.24/1.41 # ...subsumed : 17
% 0.24/1.41 # ...remaining for further processing : 106
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 3
% 0.24/1.41 # Generated clauses : 131
% 0.24/1.41 # ...of the previous two non-trivial : 73
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 131
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 103
% 0.24/1.41 # Positive orientable unit clauses : 50
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 1
% 0.24/1.41 # Non-unit-clauses : 52
% 0.24/1.41 # Current number of unprocessed clauses: 4
% 0.24/1.41 # ...number of literals in the above : 12
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 3
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 486
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 422
% 0.24/1.41 # Non-unit clause-clause subsumptions : 17
% 0.24/1.41 # Unit Clause-clause subsumption calls : 108
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 2
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 4392
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.017 s
% 0.24/1.41 # System time : 0.003 s
% 0.24/1.41 # Total time : 0.020 s
% 0.24/1.41 # Maximum resident set size: 3260 pages
%------------------------------------------------------------------------------