TSTP Solution File: CSR019+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 02:46:33 EDT 2022
% Result : Theorem 8.43s 2.69s
% Output : CNFRefutation 8.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 11 unt; 0 def)
% Number of atoms : 474 ( 244 equ)
% Maximal formula atoms : 149 ( 15 avg)
% Number of connectives : 607 ( 164 ~; 316 |; 120 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 56 ( 3 sgn 34 !; 0 ?)
% 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(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(not_forwards_2,conjecture,
~ holdsAt(forwards,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_forwards_2) ).
fof(plus1_1,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(c_0_5,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) ).
fof(c_0_6,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_7,plain,
! [X97,X98,X99] :
( ( X98 = pull
| X98 = pull
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| X98 = pull
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| X98 = pull
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| X97 = forwards
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| X97 = forwards
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| X97 = forwards
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| ~ happens(push,X99)
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| ~ happens(push,X99)
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| ~ happens(push,X99)
| X98 = push
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| X98 = pull
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| X98 = pull
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| X98 = pull
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| X97 = forwards
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| X97 = forwards
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| X97 = forwards
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| ~ happens(push,X99)
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| ~ happens(push,X99)
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| ~ happens(push,X99)
| X97 = backwards
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| X98 = pull
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| X98 = pull
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| X98 = pull
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| X97 = forwards
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| X97 = forwards
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| X97 = forwards
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( X98 = pull
| ~ happens(push,X99)
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( X97 = forwards
| ~ happens(push,X99)
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( happens(push,X99)
| ~ happens(push,X99)
| ~ happens(pull,X99)
| ~ epred2_3(X99,X98,X97) )
& ( X98 != push
| X97 != backwards
| happens(pull,X99)
| epred2_3(X99,X98,X97) )
& ( X98 != pull
| X97 != forwards
| happens(push,X99)
| epred2_3(X99,X98,X97) )
& ( X98 != pull
| X97 != forwards
| ~ happens(push,X99)
| epred2_3(X99,X98,X97) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,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_6,c_0_5]) ).
cnf(c_0_9,plain,
( happens(push,X3)
| epred2_3(X3,X1,X2)
| X1 != pull
| X2 != forwards ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,axiom,
! [X4,X2,X5] :
( terminates(X4,X2,X5)
<=> epred3_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[terminates_all_defn,c_0_6]) ).
fof(c_0_11,plain,
! [X100,X101,X102] :
( ( X101 = pull
| X101 = push
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X101 = push
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X101 = push
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X100 = spinning
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X100 = spinning
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X100 = spinning
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| ~ happens(pull,X102)
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| ~ happens(pull,X102)
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| ~ happens(pull,X102)
| X101 = pull
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X101 = push
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X101 = push
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X101 = push
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X100 = spinning
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X100 = spinning
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X100 = spinning
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| ~ happens(pull,X102)
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| ~ happens(pull,X102)
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| ~ happens(pull,X102)
| X100 = backwards
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X101 = push
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X101 = push
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X101 = push
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| X100 = spinning
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| X100 = spinning
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| X100 = spinning
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X101 = pull
| ~ happens(pull,X102)
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( X100 = spinning
| ~ happens(pull,X102)
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ happens(push,X102)
| ~ happens(pull,X102)
| happens(push,X102)
| epred2_3(X102,X101,X100)
| ~ epred3_3(X102,X101,X100) )
& ( ~ epred2_3(X102,X101,X100)
| epred3_3(X102,X101,X100) )
& ( X101 != pull
| X100 != backwards
| ~ happens(push,X102)
| epred3_3(X102,X101,X100) )
& ( X101 != push
| X100 != spinning
| happens(pull,X102)
| epred3_3(X102,X101,X100) )
& ( X101 != pull
| X100 != spinning
| happens(push,X102)
| epred3_3(X102,X101,X100) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_12,plain,
( epred2_3(X3,X1,X2)
| X1 != pull
| X2 != forwards
| ~ happens(push,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( epred2_3(X1,pull,forwards)
| happens(push,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
fof(c_0_14,plain,
! [X68,X69,X70] :
( ( ~ terminates(X68,X69,X70)
| epred3_3(X70,X68,X69) )
& ( ~ epred3_3(X70,X68,X69)
| terminates(X68,X69,X70) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_15,plain,
( epred3_3(X1,X2,X3)
| ~ epred2_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
epred2_3(X1,pull,forwards),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]),c_0_13]) ).
fof(c_0_17,plain,
! [X56,X57,X58] :
( ~ happens(X56,X57)
| ~ terminates(X56,X58,X57)
| ~ holdsAt(X58,plus(X57,n1)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[happens_terminates_not_holds])])]) ).
cnf(c_0_18,plain,
( terminates(X2,X3,X1)
| ~ epred3_3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
epred3_3(X1,pull,forwards),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X74,X75] :
( ( X74 = push
| X74 = pull
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X74 = pull
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X74 = pull
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X75 = n1
| X74 = push
| ~ happens(X74,X75) )
& ( X74 = push
| X74 = pull
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X74 = pull
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 = push
| X74 = pull
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X74 = pull
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 = push
| X75 = n2
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X75 = n2
| X75 = n2
| X75 = n1
| X75 = n0
| ~ happens(X74,X75) )
& ( X74 != push
| X75 != n0
| happens(X74,X75) )
& ( X74 != pull
| X75 != n1
| happens(X74,X75) )
& ( X74 != pull
| X75 != n2
| happens(X74,X75) )
& ( X74 != push
| X75 != n2
| happens(X74,X75) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[happens_all_defn])])]) ).
fof(c_0_21,negated_conjecture,
~ ~ holdsAt(forwards,n2),
inference(assume_negation,[status(cth)],[not_forwards_2]) ).
cnf(c_0_22,plain,
( ~ happens(X1,X2)
| ~ terminates(X1,X3,X2)
| ~ holdsAt(X3,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
terminates(pull,forwards,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( happens(X1,X2)
| X1 != pull
| X2 != n1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,negated_conjecture,
holdsAt(forwards,n2),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ holdsAt(forwards,plus(X1,n1))
| ~ happens(pull,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
happens(pull,n1),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).
cnf(c_0_28,plain,
plus(n1,n1) = n2,
inference(split_conjunct,[status(thm)],[plus1_1]) ).
cnf(c_0_29,negated_conjecture,
holdsAt(forwards,n2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.09/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 11 00:56:38 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.43/2.69 # ENIGMATIC: Solved by autoschedule:
% 8.43/2.69 # No SInE strategy applied
% 8.43/2.69 # Trying AutoSched0 for 150 seconds
% 8.43/2.69 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 8.43/2.69 # and selection function SelectCQArNTNpEqFirst.
% 8.43/2.69 #
% 8.43/2.69 # Preprocessing time : 0.017 s
% 8.43/2.69 # Presaturation interreduction done
% 8.43/2.69
% 8.43/2.69 # Proof found!
% 8.43/2.69 # SZS status Theorem
% 8.43/2.69 # SZS output start CNFRefutation
% See solution above
% 8.43/2.69 # Training examples: 0 positive, 0 negative
% 8.43/2.69
% 8.43/2.69 # -------------------------------------------------
% 8.43/2.69 # User time : 0.024 s
% 8.43/2.69 # System time : 0.009 s
% 8.43/2.69 # Total time : 0.033 s
% 8.43/2.69 # Maximum resident set size: 7120 pages
% 8.43/2.69
%------------------------------------------------------------------------------