TSTP Solution File: CSR015+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:24 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 18 unt; 0 def)
% Number of atoms : 573 ( 277 equ)
% Maximal formula atoms : 149 ( 9 avg)
% Number of connectives : 726 ( 212 ~; 366 |; 137 &)
% ( 9 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 118 ( 20 sgn 68 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(terminates_all_defn,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
fof(happens_terminates_not_holds,axiom,
! [X4,X5,X2] :
( ( happens(X4,X5)
& terminates(X4,X2,X5) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',plus0_1) ).
fof(not_backwards_1,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',not_backwards_1) ).
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(keep_not_holding,axiom,
! [X2,X5] :
( ( ~ holdsAt(X2,X5)
& ~ releasedAt(X2,plus(X5,n1))
& ~ ? [X4] :
( happens(X4,X5)
& initiates(X4,X2,X5) ) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',keep_not_holding) ).
fof(not_releasedAt,hypothesis,
! [X2,X5] : ~ releasedAt(X2,X5),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',not_releasedAt) ).
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(not_backwards_0,hypothesis,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',not_backwards_0) ).
fof(push_not_pull,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(forwards_not_backwards,axiom,
forwards != backwards,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',forwards_not_backwards) ).
fof(c_0_11,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) )
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
introduced(definition) ).
fof(c_0_12,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[terminates_all_defn,c_0_11]) ).
fof(c_0_13,plain,
! [X6,X7,X8] :
( ~ happens(X6,X7)
| ~ terminates(X6,X8,X7)
| ~ holdsAt(X8,plus(X7,n1)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])]) ).
fof(c_0_14,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( ~ terminates(X6,X7,X8)
| epred3_3(X8,X6,X7) )
& ( ~ epred3_3(X8,X6,X7)
| terminates(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_12])])])]) ).
fof(c_0_15,plain,
! [X2,X4,X5] :
( epred2_3(X5,X4,X2)
<=> ( ( X4 = push
& X2 = backwards
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = forwards
& ~ happens(push,X5) )
| ( X4 = pull
& X2 = forwards
& happens(push,X5) ) ) ),
introduced(definition) ).
cnf(c_0_16,plain,
( ~ holdsAt(X1,plus(X2,n1))
| ~ terminates(X3,X1,X2)
| ~ happens(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( terminates(X1,X2,X3)
| ~ epred3_3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X2,X4,X5] :
( epred3_3(X5,X4,X2)
<=> ( epred2_3(X5,X4,X2)
| ( X4 = pull
& X2 = backwards
& happens(push,X5) )
| ( X4 = push
& X2 = spinning
& ~ happens(pull,X5) )
| ( X4 = pull
& X2 = spinning
& ~ happens(push,X5) ) ) ),
inference(apply_def,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_19,plain,
( ~ epred3_3(X1,X2,X3)
| ~ holdsAt(X3,plus(X1,n1))
| ~ happens(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_21,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( X7 = pull
| X7 = push
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = push
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X7 = push
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X6 = spinning
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = spinning
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X6 = spinning
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(pull,X8)
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(pull,X8)
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| ~ happens(pull,X8)
| X7 = pull
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X7 = push
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = push
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X7 = push
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X6 = spinning
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = spinning
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X6 = spinning
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(pull,X8)
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(pull,X8)
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| ~ happens(pull,X8)
| X6 = backwards
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X7 = push
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X7 = push
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X7 = push
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| X6 = spinning
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| X6 = spinning
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| X6 = spinning
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X7 = pull
| ~ happens(pull,X8)
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( X6 = spinning
| ~ happens(pull,X8)
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ happens(push,X8)
| ~ happens(pull,X8)
| happens(push,X8)
| epred2_3(X8,X7,X6)
| ~ epred3_3(X8,X7,X6) )
& ( ~ epred2_3(X8,X7,X6)
| epred3_3(X8,X7,X6) )
& ( X7 != pull
| X6 != backwards
| ~ happens(push,X8)
| epred3_3(X8,X7,X6) )
& ( X7 != push
| X6 != spinning
| happens(pull,X8)
| epred3_3(X8,X7,X6) )
& ( X7 != pull
| X6 != spinning
| happens(push,X8)
| epred3_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_18])])])])])]) ).
fof(c_0_22,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(assume_negation,[status(cth)],[not_backwards_1]) ).
cnf(c_0_23,plain,
( ~ epred3_3(n0,X1,X2)
| ~ holdsAt(X2,n1)
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( epred3_3(X1,X2,X3)
| ~ happens(push,X1)
| X3 != backwards
| X2 != pull ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_25,negated_conjecture,
holdsAt(backwards,n1),
inference(fof_simplification,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( X1 != backwards
| X2 != pull
| ~ holdsAt(X1,n1)
| ~ happens(push,n0)
| ~ happens(X2,n0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
holdsAt(backwards,n1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,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])])])])]) ).
fof(c_0_29,plain,
! [X6,X7] :
( ( happens(esk2_2(X6,X7),X7)
| holdsAt(X6,X7)
| releasedAt(X6,plus(X7,n1))
| ~ holdsAt(X6,plus(X7,n1)) )
& ( initiates(esk2_2(X6,X7),X6,X7)
| holdsAt(X6,X7)
| releasedAt(X6,plus(X7,n1))
| ~ holdsAt(X6,plus(X7,n1)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[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)],[keep_not_holding])])])])])])]) ).
fof(c_0_30,hypothesis,
! [X6,X7] : ~ releasedAt(X6,X7),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[not_releasedAt])]) ).
cnf(c_0_31,negated_conjecture,
( X1 != pull
| ~ happens(push,n0)
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( happens(X1,X2)
| X2 != n0
| X1 != push ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( releasedAt(X1,plus(X2,n1))
| holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,hypothesis,
~ releasedAt(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( X1 = push
| X1 = pull
| X1 = pull
| X1 = push
| ~ happens(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_36,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) ).
cnf(c_0_37,negated_conjecture,
( X1 != pull
| ~ happens(X1,n0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( holdsAt(X1,X2)
| happens(esk2_2(X1,X2),X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( X1 = push
| X1 = pull
| ~ happens(X1,X2) ),
inference(cn,[status(thm)],[c_0_35]) ).
fof(c_0_40,axiom,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[initiates_all_defn,c_0_36]) ).
cnf(c_0_41,plain,
( releasedAt(X1,plus(X2,n1))
| holdsAt(X1,X2)
| initiates(esk2_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( holdsAt(X1,n0)
| esk2_2(X1,n0) != pull
| ~ holdsAt(X1,n1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_20]) ).
cnf(c_0_43,plain,
( esk2_2(X1,X2) = push
| esk2_2(X1,X2) = pull
| holdsAt(X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
fof(c_0_44,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_40])])])]) ).
cnf(c_0_45,plain,
( holdsAt(X1,X2)
| initiates(esk2_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
( esk2_2(X1,n0) = push
| holdsAt(X1,n0)
| ~ holdsAt(X1,n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_20])]) ).
fof(c_0_47,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_36])])])])])]) ).
cnf(c_0_48,plain,
( epred1_3(X1,X2,X3)
| ~ initiates(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( holdsAt(X1,n0)
| initiates(push,X1,n0)
| ~ holdsAt(X1,n1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_20])]) ).
fof(c_0_50,hypothesis,
~ holdsAt(backwards,n0),
inference(fof_simplification,[status(thm)],[not_backwards_0]) ).
cnf(c_0_51,plain,
( X3 = forwards
| X2 = pull
| X2 = pull
| ~ epred1_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( epred1_3(n0,push,X1)
| holdsAt(X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,hypothesis,
~ holdsAt(backwards,n0),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,plain,
( X3 = forwards
| X2 = pull
| ~ epred1_3(X1,X2,X3) ),
inference(cn,[status(thm)],[c_0_51]) ).
cnf(c_0_55,negated_conjecture,
epred1_3(n0,push,backwards),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_27]),c_0_53]) ).
cnf(c_0_56,plain,
push != pull,
inference(split_conjunct,[status(thm)],[push_not_pull]) ).
cnf(c_0_57,plain,
forwards != backwards,
inference(split_conjunct,[status(thm)],[forwards_not_backwards]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.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 17:44:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.020 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 59
% 0.22/1.40 # Proof object clause steps : 31
% 0.22/1.40 # Proof object formula steps : 28
% 0.22/1.40 # Proof object conjectures : 11
% 0.22/1.40 # Proof object clause conjectures : 8
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 15
% 0.22/1.40 # Proof object initial formulas used : 11
% 0.22/1.40 # Proof object generating inferences : 12
% 0.22/1.40 # Proof object simplifying inferences : 12
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 48
% 0.22/1.40 # Removed by relevancy pruning/SinE : 17
% 0.22/1.40 # Initial clauses : 154
% 0.22/1.40 # Removed in clause preprocessing : 9
% 0.22/1.40 # Initial clauses in saturation : 145
% 0.22/1.40 # Processed clauses : 248
% 0.22/1.40 # ...of these trivial : 1
% 0.22/1.40 # ...subsumed : 100
% 0.22/1.40 # ...remaining for further processing : 147
% 0.22/1.40 # Other redundant clauses eliminated : 2
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 4
% 0.22/1.40 # Backward-rewritten : 1
% 0.22/1.40 # Generated clauses : 320
% 0.22/1.40 # ...of the previous two non-trivial : 183
% 0.22/1.40 # Contextual simplify-reflections : 71
% 0.22/1.40 # Paramodulations : 311
% 0.22/1.40 # Factorizations : 4
% 0.22/1.40 # Equation resolutions : 5
% 0.22/1.40 # Current number of processed clauses : 140
% 0.22/1.40 # Positive orientable unit clauses : 16
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 15
% 0.22/1.40 # Non-unit-clauses : 108
% 0.22/1.40 # Current number of unprocessed clauses: 77
% 0.22/1.40 # ...number of literals in the above : 345
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 5
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 1472
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 854
% 0.22/1.40 # Non-unit clause-clause subsumptions : 148
% 0.22/1.40 # Unit Clause-clause subsumption calls : 132
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 7
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 9528
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.031 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.032 s
% 0.22/1.40 # Maximum resident set size: 3492 pages
%------------------------------------------------------------------------------