TSTP Solution File: CSR023+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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:25 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 300 ( 172 equ)
% Maximal formula atoms : 120 ( 9 avg)
% Number of connectives : 382 ( 113 ~; 198 |; 66 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 64 ( 9 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(initiates_all_defn,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = forwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = backwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = spinning
& happens(push,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).
fof(happens_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& initiates(X4,X2,X5) )
=> holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_holds) ).
fof(happens_all_defn,axiom,
! [X4,X5] :
( happens(X4,X5)
<=> ( ( X4 = push
& X5 = n0 )
| ( X4 = pull
& X5 = n1 )
| ( X4 = pull
& X5 = n2 )
| ( X4 = push
& X5 = n2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_of_plus) ).
fof(spinning_3,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',spinning_3) ).
fof(plus1_2,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',plus1_2) ).
fof(c_0_6,plain,
! [X2,X4,X5] :
( epred1_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = forwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = backwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = spinning
& happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_7,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[initiates_all_defn,c_0_6]) ).
fof(c_0_8,plain,
! [X6,X7,X8] :
( ~ happens(X6,X7)
| ~ initiates(X6,X8,X7)
| holdsAt(X8,plus(X7,n1)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_holds])]) ).
fof(c_0_9,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( ~ initiates(X6,X7,X8)
| epred1_3(X8,X6,X7) )
& ( ~ epred1_3(X8,X6,X7)
| initiates(X6,X7,X8) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( holdsAt(X1,plus(X2,n1))
| ~ initiates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( initiates(X1,X2,X3)
| ~ epred1_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( X7 = pull
| X7 = pull
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = pull
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| X7 = pull
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| X6 = backwards
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = backwards
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| X6 = backwards
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(push,X8)
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(push,X8)
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| ~ happens(push,X8)
| X7 = push
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| X7 = pull
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = pull
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| X7 = pull
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| X6 = backwards
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = backwards
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| X6 = backwards
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(push,X8)
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(push,X8)
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| ~ happens(push,X8)
| X6 = forwards
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| X7 = pull
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = pull
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| X7 = pull
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| X6 = backwards
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = backwards
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| X6 = backwards
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(push,X8)
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(push,X8)
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( happens(push,X8)
| ~ happens(push,X8)
| ~ happens(pull,X8)
| ~ epred1_3(X8,X7,X6) )
& ( X7 != push
| X6 != forwards
| happens(pull,X8)
| epred1_3(X8,X7,X6) )
& ( X7 != pull
| X6 != backwards
| happens(push,X8)
| epred1_3(X8,X7,X6) )
& ( X7 != pull
| X6 != spinning
| ~ happens(push,X8)
| epred1_3(X8,X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_6])])])])])]) ).
cnf(c_0_13,plain,
( holdsAt(X1,plus(X2,n1))
| ~ epred1_3(X2,X3,X1)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( epred1_3(X1,X2,X3)
| ~ happens(push,X1)
| X3 != spinning
| X2 != pull ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X6,X7,X6,X7] :
( ( X6 = push
| X6 = pull
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X6 = pull
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X6 = pull
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X7 = n1
| X6 = push
| ~ happens(X6,X7) )
& ( X6 = push
| X6 = pull
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X6 = pull
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = push
| X6 = pull
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X6 = pull
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 = push
| X7 = n2
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X7 = n2
| X7 = n2
| X7 = n1
| X7 = n0
| ~ happens(X6,X7) )
& ( X6 != push
| X7 != n0
| happens(X6,X7) )
& ( X6 != pull
| X7 != n1
| happens(X6,X7) )
& ( X6 != pull
| X7 != n2
| happens(X6,X7) )
& ( X6 != push
| X7 != n2
| happens(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])])])]) ).
cnf(c_0_16,plain,
( holdsAt(X1,plus(X2,n1))
| X1 != spinning
| X3 != pull
| ~ happens(push,X2)
| ~ happens(X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( happens(X1,X2)
| X2 != n2
| X1 != pull ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X11,X12] : plus(X11,X12) = plus(X12,X11),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_19,negated_conjecture,
~ holdsAt(spinning,n3),
inference(assume_negation,[status(cth)],[spinning_3]) ).
cnf(c_0_20,plain,
( holdsAt(X1,plus(X2,n1))
| X1 != spinning
| X3 != pull
| X2 != n2
| ~ happens(push,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
plus(n1,n2) = n3,
inference(split_conjunct,[status(thm)],[plus1_2]) ).
cnf(c_0_22,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,negated_conjecture,
~ holdsAt(spinning,n3),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( holdsAt(X1,plus(X2,n1))
| X1 != spinning
| X2 != n2
| ~ happens(push,X2) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
plus(n2,n1) = n3,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ holdsAt(spinning,n3),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
( holdsAt(X1,n3)
| X1 != spinning
| ~ happens(push,n2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ happens(push,n2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( happens(X1,X2)
| X2 != n2
| X1 != push ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 19:26:22 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.020 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 31
% 0.24/1.42 # Proof object clause steps : 16
% 0.24/1.42 # Proof object formula steps : 15
% 0.24/1.42 # Proof object conjectures : 6
% 0.24/1.42 # Proof object clause conjectures : 3
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 8
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 7
% 0.24/1.42 # Proof object simplifying inferences : 1
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 48
% 0.24/1.42 # Removed by relevancy pruning/SinE : 17
% 0.24/1.42 # Initial clauses : 154
% 0.24/1.42 # Removed in clause preprocessing : 9
% 0.24/1.42 # Initial clauses in saturation : 145
% 0.24/1.42 # Processed clauses : 634
% 0.24/1.42 # ...of these trivial : 4
% 0.24/1.42 # ...subsumed : 249
% 0.24/1.42 # ...remaining for further processing : 381
% 0.24/1.42 # Other redundant clauses eliminated : 2
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 30
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 2149
% 0.24/1.42 # ...of the previous two non-trivial : 1306
% 0.24/1.42 # Contextual simplify-reflections : 208
% 0.24/1.42 # Paramodulations : 2117
% 0.24/1.42 # Factorizations : 4
% 0.24/1.42 # Equation resolutions : 27
% 0.24/1.42 # Current number of processed clauses : 348
% 0.24/1.42 # Positive orientable unit clauses : 13
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 16
% 0.24/1.42 # Non-unit-clauses : 318
% 0.24/1.42 # Current number of unprocessed clauses: 751
% 0.24/1.42 # ...number of literals in the above : 5630
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 31
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 35284
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 3044
% 0.24/1.42 # Non-unit clause-clause subsumptions : 429
% 0.24/1.42 # Unit Clause-clause subsumption calls : 177
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 5
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 41780
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.101 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.106 s
% 0.24/1.42 # Maximum resident set size: 4548 pages
%------------------------------------------------------------------------------