TSTP Solution File: CSR026+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR026+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:27 EDT 2022
% Result : Theorem 0.84s 3.03s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 18 ~; 12 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query126,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query126) ).
fof(ax2_1907,axiom,
! [X2] :
( ( mtvisible(c_tptp_member2701_mt)
& runningshorts(X2) )
=> tptpofobject(X2,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1907) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_1317,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1317) ).
fof(ax2_2882,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2882) ).
fof(ax2_1645,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1645) ).
fof(ax2_142,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_142) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query126]) ).
fof(c_0_9,negated_conjecture,
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X3] :
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X3)
| tptpofobject(X3,f_tptpquantityfn_2(n_756)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1907])]) ).
fof(c_0_11,plain,
! [X23,X24] :
( ~ mtvisible(X23)
| ~ genlmt(X23,X24)
| mtvisible(X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])]) ).
cnf(c_0_12,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ runningshorts(X1)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(fof_nnf,[status(thm)],[ax2_1317]) ).
cnf(c_0_15,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[ax2_2882]) ).
cnf(c_0_17,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[ax2_1645]) ).
cnf(c_0_21,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_142]) ).
cnf(c_0_22,plain,
mtvisible(c_tptp_member3633_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
( ~ mtvisible(c_tptp_member2701_mt)
| ~ mtvisible(c_cyclistsmt) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_17])]) ).
cnf(c_0_25,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
cnf(c_0_26,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR026+3 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 17:07:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.84/3.03 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.84/3.03 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.84/3.03 # Preprocessing time : 0.161 s
% 0.84/3.03
% 0.84/3.03 # Failure: Out of unprocessed clauses!
% 0.84/3.03 # OLD status GaveUp
% 0.84/3.03 # Parsed axioms : 8006
% 0.84/3.03 # Removed by relevancy pruning/SinE : 7940
% 0.84/3.03 # Initial clauses : 67
% 0.84/3.03 # Removed in clause preprocessing : 0
% 0.84/3.03 # Initial clauses in saturation : 67
% 0.84/3.03 # Processed clauses : 110
% 0.84/3.03 # ...of these trivial : 2
% 0.84/3.03 # ...subsumed : 21
% 0.84/3.03 # ...remaining for further processing : 87
% 0.84/3.03 # Other redundant clauses eliminated : 0
% 0.84/3.03 # Clauses deleted for lack of memory : 0
% 0.84/3.03 # Backward-subsumed : 0
% 0.84/3.03 # Backward-rewritten : 2
% 0.84/3.03 # Generated clauses : 82
% 0.84/3.03 # ...of the previous two non-trivial : 47
% 0.84/3.03 # Contextual simplify-reflections : 0
% 0.84/3.03 # Paramodulations : 82
% 0.84/3.03 # Factorizations : 0
% 0.84/3.03 # Equation resolutions : 0
% 0.84/3.03 # Current number of processed clauses : 85
% 0.84/3.03 # Positive orientable unit clauses : 35
% 0.84/3.03 # Positive unorientable unit clauses: 0
% 0.84/3.03 # Negative unit clauses : 9
% 0.84/3.03 # Non-unit-clauses : 41
% 0.84/3.03 # Current number of unprocessed clauses: 0
% 0.84/3.03 # ...number of literals in the above : 0
% 0.84/3.03 # Current number of archived formulas : 0
% 0.84/3.03 # Current number of archived clauses : 2
% 0.84/3.03 # Clause-clause subsumption calls (NU) : 178
% 0.84/3.03 # Rec. Clause-clause subsumption calls : 159
% 0.84/3.03 # Non-unit clause-clause subsumptions : 18
% 0.84/3.03 # Unit Clause-clause subsumption calls : 69
% 0.84/3.03 # Rewrite failures with RHS unbound : 0
% 0.84/3.03 # BW rewrite match attempts : 1
% 0.84/3.03 # BW rewrite match successes : 1
% 0.84/3.03 # Condensation attempts : 0
% 0.84/3.03 # Condensation successes : 0
% 0.84/3.03 # Termbank termtop insertions : 54131
% 0.84/3.03
% 0.84/3.03 # -------------------------------------------------
% 0.84/3.03 # User time : 0.153 s
% 0.84/3.03 # System time : 0.010 s
% 0.84/3.03 # Total time : 0.163 s
% 0.84/3.03 # Maximum resident set size: 19964 pages
% 0.84/3.03 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.84/3.03 # Preprocessing time : 0.298 s
% 0.84/3.03
% 0.84/3.03 # Proof found!
% 0.84/3.03 # SZS status Theorem
% 0.84/3.03 # SZS output start CNFRefutation
% See solution above
% 0.84/3.03 # Proof object total steps : 29
% 0.84/3.03 # Proof object clause steps : 16
% 0.84/3.03 # Proof object formula steps : 13
% 0.84/3.03 # Proof object conjectures : 8
% 0.84/3.03 # Proof object clause conjectures : 5
% 0.84/3.03 # Proof object formula conjectures : 3
% 0.84/3.03 # Proof object initial clauses used : 9
% 0.84/3.03 # Proof object initial formulas used : 8
% 0.84/3.03 # Proof object generating inferences : 6
% 0.84/3.03 # Proof object simplifying inferences : 11
% 0.84/3.03 # Training examples: 0 positive, 0 negative
% 0.84/3.03 # Parsed axioms : 8006
% 0.84/3.03 # Removed by relevancy pruning/SinE : 0
% 0.84/3.03 # Initial clauses : 8007
% 0.84/3.03 # Removed in clause preprocessing : 0
% 0.84/3.03 # Initial clauses in saturation : 8007
% 0.84/3.03 # Processed clauses : 8748
% 0.84/3.03 # ...of these trivial : 672
% 0.84/3.03 # ...subsumed : 346
% 0.84/3.03 # ...remaining for further processing : 7729
% 0.84/3.03 # Other redundant clauses eliminated : 0
% 0.84/3.03 # Clauses deleted for lack of memory : 0
% 0.84/3.03 # Backward-subsumed : 3
% 0.84/3.03 # Backward-rewritten : 87
% 0.84/3.03 # Generated clauses : 23323
% 0.84/3.03 # ...of the previous two non-trivial : 21658
% 0.84/3.03 # Contextual simplify-reflections : 20
% 0.84/3.03 # Paramodulations : 23323
% 0.84/3.03 # Factorizations : 0
% 0.84/3.03 # Equation resolutions : 0
% 0.84/3.03 # Current number of processed clauses : 7639
% 0.84/3.03 # Positive orientable unit clauses : 3082
% 0.84/3.03 # Positive unorientable unit clauses: 0
% 0.84/3.03 # Negative unit clauses : 97
% 0.84/3.03 # Non-unit-clauses : 4460
% 0.84/3.03 # Current number of unprocessed clauses: 20734
% 0.84/3.03 # ...number of literals in the above : 37501
% 0.84/3.03 # Current number of archived formulas : 0
% 0.84/3.03 # Current number of archived clauses : 90
% 0.84/3.03 # Clause-clause subsumption calls (NU) : 2591349
% 0.84/3.03 # Rec. Clause-clause subsumption calls : 2426461
% 0.84/3.03 # Non-unit clause-clause subsumptions : 365
% 0.84/3.03 # Unit Clause-clause subsumption calls : 212700
% 0.84/3.03 # Rewrite failures with RHS unbound : 0
% 0.84/3.03 # BW rewrite match attempts : 2622
% 0.84/3.03 # BW rewrite match successes : 43
% 0.84/3.03 # Condensation attempts : 0
% 0.84/3.03 # Condensation successes : 0
% 0.84/3.03 # Termbank termtop insertions : 491609
% 0.84/3.03
% 0.84/3.03 # -------------------------------------------------
% 0.84/3.03 # User time : 1.007 s
% 0.84/3.03 # System time : 0.032 s
% 0.84/3.03 # Total time : 1.039 s
% 0.84/3.03 # Maximum resident set size: 67092 pages
%------------------------------------------------------------------------------