%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR044+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:45 EDT 2022
% Result : Theorem 0.29s 1.46s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 66 ( 29 ~; 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(query94,conjecture,
? [X13] :
( mtvisible(c_tptp_member3633_mt)
=> ( tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13)
& tptpcol_16_29490(X13) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query94) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(ax1_164,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/benchmark/Axioms/CSR002+1.ax',ax1_164) ).
fof(ax1_243,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_243) ).
fof(ax1_94,axiom,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_94) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_254) ).
fof(ax1_783,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_29490)
=> tptpcol_16_29490(X13) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_783) ).
fof(ax1_297,axiom,
! [X7,X8,X3,X9] :
( ( isa(X7,X8)
& relationallexists(X3,X8,X9) )
=> isa(f_relationallexistsfn(X7,X3,X8,X9),X9) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_297) ).
fof(ax1_165,axiom,
( mtvisible(c_cyclistsmt)
=> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_165) ).
fof(ax1_919,axiom,
! [X13] :
( executionbyfiringsquad(X13)
=> isa(X13,c_executionbyfiringsquad) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_919) ).
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)],[query94]) ).
fof(c_0_11,plain,
! [X22,X23] :
( ~ mtvisible(X22)
| ~ genlmt(X22,X23)
| mtvisible(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])]) ).
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])])])]) ).
fof(c_0_13,plain,
! [X8] :
( ~ mtvisible(c_cyclistsmt)
| ~ executionbyfiringsquad(X8)
| tptp_9_720(X8,f_relationallexistsfn(X8,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_164])]) ).
cnf(c_0_14,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_243]) ).
cnf(c_0_16,negated_conjecture,
mtvisible(c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ tptpcol_16_29490(X1)
| ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,plain,
executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
inference(split_conjunct,[status(thm)],[ax1_94]) ).
cnf(c_0_20,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_21,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
fof(c_0_22,plain,
! [X14] :
( ~ isa(X14,c_tptpcol_16_29490)
| tptpcol_16_29490(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_783])]) ).
fof(c_0_23,plain,
! [X10,X11,X12,X13] :
( ~ isa(X10,X11)
| ~ relationallexists(X12,X11,X13)
| isa(f_relationallexistsfn(X10,X12,X11,X13),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_297])]) ).
fof(c_0_24,plain,
( ~ mtvisible(c_cyclistsmt)
| relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
inference(fof_nnf,[status(thm)],[ax1_165]) ).
cnf(c_0_25,negated_conjecture,
( ~ tptpcol_16_29490(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
| ~ mtvisible(c_cyclistsmt) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_21])]) ).
cnf(c_0_27,plain,
( tptpcol_16_29490(X1)
| ~ isa(X1,c_tptpcol_16_29490) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( isa(f_relationallexistsfn(X1,X2,X3,X4),X4)
| ~ relationallexists(X2,X3,X4)
| ~ isa(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,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_30,negated_conjecture,
~ tptpcol_16_29490(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_31,plain,
( tptpcol_16_29490(f_relationallexistsfn(X1,X2,X3,c_tptpcol_16_29490))
| ~ relationallexists(X2,X3,c_tptpcol_16_29490)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
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_29,c_0_26])]) ).
fof(c_0_33,plain,
! [X14] :
( ~ executionbyfiringsquad(X14)
| isa(X14,c_executionbyfiringsquad) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_919])]) ).
cnf(c_0_34,negated_conjecture,
~ isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( isa(X1,c_executionbyfiringsquad)
| ~ executionbyfiringsquad(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR044+2 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 20:14:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.29/1.46 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.29/1.46 # Preprocessing time : 0.050 s
% 0.29/1.46
% 0.29/1.46 # Proof found!
% 0.29/1.46 # SZS status Theorem
% 0.29/1.46 # SZS output start CNFRefutation
% See solution above
% 0.29/1.46 # Proof object total steps : 37
% 0.29/1.46 # Proof object clause steps : 19
% 0.29/1.46 # Proof object formula steps : 18
% 0.29/1.46 # Proof object conjectures : 9
% 0.29/1.46 # Proof object clause conjectures : 6
% 0.29/1.46 # Proof object formula conjectures : 3
% 0.29/1.46 # Proof object initial clauses used : 11
% 0.29/1.46 # Proof object initial formulas used : 10
% 0.29/1.46 # Proof object generating inferences : 6
% 0.29/1.46 # Proof object simplifying inferences : 14
% 0.29/1.46 # Training examples: 0 positive, 0 negative
% 0.29/1.46 # Parsed axioms : 1132
% 0.29/1.46 # Removed by relevancy pruning/SinE : 0
% 0.29/1.46 # Initial clauses : 1133
% 0.29/1.46 # Removed in clause preprocessing : 0
% 0.29/1.46 # Initial clauses in saturation : 1133
% 0.29/1.46 # Processed clauses : 2595
% 0.29/1.46 # ...of these trivial : 361
% 0.29/1.46 # ...subsumed : 83
% 0.29/1.46 # ...remaining for further processing : 2151
% 0.29/1.46 # Other redundant clauses eliminated : 0
% 0.29/1.46 # Clauses deleted for lack of memory : 0
% 0.29/1.46 # Backward-subsumed : 2
% 0.29/1.46 # Backward-rewritten : 43
% 0.29/1.46 # Generated clauses : 3876
% 0.29/1.46 # ...of the previous two non-trivial : 3610
% 0.29/1.46 # Contextual simplify-reflections : 0
% 0.29/1.46 # Paramodulations : 3876
% 0.29/1.46 # Factorizations : 0
% 0.29/1.46 # Equation resolutions : 0
% 0.29/1.46 # Current number of processed clauses : 2106
% 0.29/1.46 # Positive orientable unit clauses : 830
% 0.29/1.46 # Positive unorientable unit clauses: 0
% 0.29/1.46 # Negative unit clauses : 177
% 0.29/1.46 # Non-unit-clauses : 1099
% 0.29/1.46 # Current number of unprocessed clauses: 2120
% 0.29/1.46 # ...number of literals in the above : 4852
% 0.29/1.46 # Current number of archived formulas : 0
% 0.29/1.46 # Current number of archived clauses : 45
% 0.29/1.46 # Clause-clause subsumption calls (NU) : 189100
% 0.29/1.46 # Rec. Clause-clause subsumption calls : 175145
% 0.29/1.46 # Non-unit clause-clause subsumptions : 83
% 0.29/1.46 # Unit Clause-clause subsumption calls : 146224
% 0.29/1.46 # Rewrite failures with RHS unbound : 0
% 0.29/1.46 # BW rewrite match attempts : 22
% 0.29/1.46 # BW rewrite match successes : 19
% 0.29/1.46 # Condensation attempts : 0
% 0.29/1.46 # Condensation successes : 0
% 0.29/1.46 # Termbank termtop insertions : 75604
% 0.29/1.46
% 0.29/1.46 # -------------------------------------------------
% 0.29/1.46 # User time : 0.169 s
% 0.29/1.46 # System time : 0.012 s
% 0.29/1.46 # Total time : 0.181 s
% 0.29/1.46 # Maximum resident set size: 13772 pages
%------------------------------------------------------------------------------