TSTP Solution File: CSR026+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR026+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 16 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 18 ~; 11 |; 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(query76,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query76) ).
fof(ax1_440,axiom,
! [X10] :
( ( mtvisible(c_tptp_member2701_mt)
& runningshorts(X10) )
=> tptpofobject(X10,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_440) ).
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_344,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_344) ).
fof(ax1_163,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_163) ).
fof(ax1_364,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_364) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_254) ).
fof(ax1_315,axiom,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_315) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query76]) ).
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,
! [X11] :
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X11)
| tptpofobject(X11,f_tptpquantityfn_2(n_756)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_440])]) ).
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])]) ).
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]) ).
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_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[ax1_344]) ).
cnf(c_0_16,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_tptp_member2701_mt) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
fof(c_0_19,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(fof_nnf,[status(thm)],[ax1_163]) ).
cnf(c_0_20,negated_conjecture,
~ runningshorts(c_tptprunningshorts),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
inference(split_conjunct,[status(thm)],[ax1_364]) ).
cnf(c_0_23,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_24,negated_conjecture,
~ mtvisible(c_cyclistsmt),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_315]) ).
cnf(c_0_26,plain,
mtvisible(c_tptp_member3993_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_16])]) ).
cnf(c_0_27,plain,
~ mtvisible(c_tptp_spindleheadmt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,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_14,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : CSR026+2 : TPTP v8.1.0. Released v3.4.0.
% 0.05/0.11 % Command : run_ET %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 9 19:18:53 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.020 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 1132
% 0.21/1.40 # Removed by relevancy pruning/SinE : 1063
% 0.21/1.40 # Initial clauses : 70
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 70
% 0.21/1.40 # Processed clauses : 116
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 20
% 0.21/1.40 # ...remaining for further processing : 96
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 5
% 0.21/1.40 # Generated clauses : 82
% 0.21/1.40 # ...of the previous two non-trivial : 49
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 82
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 91
% 0.21/1.40 # Positive orientable unit clauses : 41
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 8
% 0.21/1.40 # Non-unit-clauses : 42
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 5
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 316
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 276
% 0.21/1.40 # Non-unit clause-clause subsumptions : 15
% 0.21/1.40 # Unit Clause-clause subsumption calls : 181
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 10755
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.018 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.022 s
% 0.21/1.40 # Maximum resident set size: 5472 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.031 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 29
% 0.21/1.40 # Proof object clause steps : 16
% 0.21/1.40 # Proof object formula steps : 13
% 0.21/1.40 # Proof object conjectures : 8
% 0.21/1.40 # Proof object clause conjectures : 5
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 9
% 0.21/1.40 # Proof object initial formulas used : 8
% 0.21/1.40 # Proof object generating inferences : 6
% 0.21/1.40 # Proof object simplifying inferences : 10
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 1132
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 1133
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 1133
% 0.21/1.40 # Processed clauses : 1333
% 0.21/1.40 # ...of these trivial : 46
% 0.21/1.40 # ...subsumed : 34
% 0.21/1.40 # ...remaining for further processing : 1252
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 1
% 0.21/1.40 # Backward-rewritten : 13
% 0.21/1.40 # Generated clauses : 2648
% 0.21/1.40 # ...of the previous two non-trivial : 2429
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 2648
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 1238
% 0.21/1.40 # Positive orientable unit clauses : 422
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 39
% 0.21/1.40 # Non-unit-clauses : 777
% 0.21/1.40 # Current number of unprocessed clauses: 2201
% 0.21/1.40 # ...number of literals in the above : 3850
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 14
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 98576
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 91233
% 0.21/1.40 # Non-unit clause-clause subsumptions : 31
% 0.21/1.40 # Unit Clause-clause subsumption calls : 12570
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 11
% 0.21/1.40 # BW rewrite match successes : 8
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 66745
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.070 s
% 0.21/1.40 # System time : 0.008 s
% 0.21/1.40 # Total time : 0.078 s
% 0.21/1.40 # Maximum resident set size: 11396 pages
%------------------------------------------------------------------------------