TSTP Solution File: CSR015+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : CSR015+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n001.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 : 300s
% DateTime : Wed Aug 30 18:53:18 EDT 2023
% Result : Theorem 0.23s 0.64s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 50
% Syntax : Number of formulae : 80 ( 24 unt; 39 typ; 0 def)
% Number of atoms : 311 ( 166 equ)
% Maximal formula atoms : 120 ( 7 avg)
% Number of connectives : 383 ( 113 ~; 192 |; 72 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 64 ( 24 >; 40 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-4 aty)
% Number of functors : 24 ( 24 usr; 15 con; 0-3 aty)
% Number of variables : 56 ( 3 sgn; 35 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
stoppedIn: ( $i * $i * $i ) > $o ).
tff(decl_23,type,
happens: ( $i * $i ) > $o ).
tff(decl_24,type,
less: ( $i * $i ) > $o ).
tff(decl_25,type,
terminates: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
startedIn: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
initiates: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
n0: $i ).
tff(decl_29,type,
trajectory: ( $i * $i * $i * $i ) > $o ).
tff(decl_30,type,
plus: ( $i * $i ) > $i ).
tff(decl_31,type,
holdsAt: ( $i * $i ) > $o ).
tff(decl_32,type,
antitrajectory: ( $i * $i * $i * $i ) > $o ).
tff(decl_33,type,
n1: $i ).
tff(decl_34,type,
releasedAt: ( $i * $i ) > $o ).
tff(decl_35,type,
releases: ( $i * $i * $i ) > $o ).
tff(decl_36,type,
push: $i ).
tff(decl_37,type,
forwards: $i ).
tff(decl_38,type,
pull: $i ).
tff(decl_39,type,
backwards: $i ).
tff(decl_40,type,
spinning: $i ).
tff(decl_41,type,
n2: $i ).
tff(decl_42,type,
n3: $i ).
tff(decl_43,type,
n4: $i ).
tff(decl_44,type,
n5: $i ).
tff(decl_45,type,
n6: $i ).
tff(decl_46,type,
less_or_equal: ( $i * $i ) > $o ).
tff(decl_47,type,
n7: $i ).
tff(decl_48,type,
n8: $i ).
tff(decl_49,type,
n9: $i ).
tff(decl_50,type,
epred1_3: ( $i * $i * $i ) > $o ).
tff(decl_51,type,
epred2_3: ( $i * $i * $i ) > $o ).
tff(decl_52,type,
epred3_3: ( $i * $i * $i ) > $o ).
tff(decl_53,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_57,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk8_2: ( $i * $i ) > $i ).
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/sandbox/benchmark/Axioms/CSR001+0.ax',keep_not_holding) ).
fof(not_releasedAt,hypothesis,
! [X2,X5] : ~ releasedAt(X2,X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_releasedAt) ).
fof(symmetry_of_plus,axiom,
! [X9,X10] : plus(X9,X10) = plus(X10,X9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(plus0_1,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
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/sandbox/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).
fof(not_backwards_1,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_1) ).
fof(not_backwards_0,hypothesis,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_0) ).
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/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(forwards_not_backwards,axiom,
forwards != backwards,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',forwards_not_backwards) ).
fof(spinning_not_backwards,axiom,
spinning != backwards,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',spinning_not_backwards) ).
fof(c_0_10,plain,
! [X2,X5] :
( ( ~ holdsAt(X2,X5)
& ~ releasedAt(X2,plus(X5,n1))
& ~ ? [X4] :
( happens(X4,X5)
& initiates(X4,X2,X5) ) )
=> ~ holdsAt(X2,plus(X5,n1)) ),
inference(fof_simplification,[status(thm)],[keep_not_holding]) ).
fof(c_0_11,hypothesis,
! [X2,X5] : ~ releasedAt(X2,X5),
inference(fof_simplification,[status(thm)],[not_releasedAt]) ).
fof(c_0_12,plain,
! [X44,X45] :
( ( happens(esk6_2(X44,X45),X45)
| holdsAt(X44,X45)
| releasedAt(X44,plus(X45,n1))
| ~ holdsAt(X44,plus(X45,n1)) )
& ( initiates(esk6_2(X44,X45),X44,X45)
| holdsAt(X44,X45)
| releasedAt(X44,plus(X45,n1))
| ~ holdsAt(X44,plus(X45,n1)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_13,hypothesis,
! [X92,X93] : ~ releasedAt(X92,X93),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( initiates(esk6_2(X1,X2),X1,X2)
| holdsAt(X1,X2)
| releasedAt(X1,plus(X2,n1))
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
~ releasedAt(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X76,X77] : plus(X76,X77) = plus(X77,X76),
inference(variable_rename,[status(thm)],[symmetry_of_plus]) ).
fof(c_0_17,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_18,plain,
( holdsAt(X1,X2)
| initiates(esk6_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(X2,n1)) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
plus(n0,n1) = n1,
inference(split_conjunct,[status(thm)],[plus0_1]) ).
fof(c_0_21,plain,
! [X4,X2,X5] :
( initiates(X4,X2,X5)
<=> epred1_3(X5,X4,X2) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[initiates_all_defn]),c_0_17]) ).
cnf(c_0_22,plain,
( holdsAt(X1,X2)
| initiates(esk6_2(X1,X2),X1,X2)
| ~ holdsAt(X1,plus(n1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
plus(n1,n0) = n1,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
fof(c_0_24,negated_conjecture,
holdsAt(backwards,n1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[not_backwards_1])]) ).
fof(c_0_25,hypothesis,
~ holdsAt(backwards,n0),
inference(fof_simplification,[status(thm)],[not_backwards_0]) ).
fof(c_0_26,plain,
! [X65,X66,X67] :
( ( ~ initiates(X65,X66,X67)
| epred1_3(X67,X65,X66) )
& ( ~ epred1_3(X67,X65,X66)
| initiates(X65,X66,X67) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
cnf(c_0_27,plain,
( holdsAt(X1,n0)
| initiates(esk6_2(X1,n0),X1,n0)
| ~ holdsAt(X1,n1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
holdsAt(backwards,n1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,hypothesis,
~ holdsAt(backwards,n0),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,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_31,plain,
! [X94,X95,X96] :
( ( X95 = pull
| X95 = pull
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| X95 = pull
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| X95 = pull
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| X94 = backwards
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| X94 = backwards
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| X94 = backwards
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| ~ happens(push,X96)
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| ~ happens(push,X96)
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| ~ happens(push,X96)
| X95 = push
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| X95 = pull
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| X95 = pull
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| X95 = pull
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| X94 = backwards
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| X94 = backwards
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| X94 = backwards
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| ~ happens(push,X96)
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| ~ happens(push,X96)
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| ~ happens(push,X96)
| X94 = forwards
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| X95 = pull
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| X95 = pull
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| X95 = pull
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| X94 = backwards
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| X94 = backwards
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| X94 = backwards
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( X95 = pull
| ~ happens(push,X96)
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( X94 = spinning
| ~ happens(push,X96)
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( happens(push,X96)
| ~ happens(push,X96)
| ~ happens(pull,X96)
| ~ epred1_3(X96,X95,X94) )
& ( X95 != push
| X94 != forwards
| happens(pull,X96)
| epred1_3(X96,X95,X94) )
& ( X95 != pull
| X94 != backwards
| happens(push,X96)
| epred1_3(X96,X95,X94) )
& ( X95 != pull
| X94 != spinning
| ~ happens(push,X96)
| epred1_3(X96,X95,X94) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_32,plain,
( epred1_3(X3,X1,X2)
| ~ initiates(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
initiates(esk6_2(backwards,n0),backwards,n0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
( happens(X1,X2)
| X1 != push
| X2 != n0 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( X1 = spinning
| X1 = forwards
| ~ happens(push,X2)
| ~ epred1_3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
epred1_3(n0,esk6_2(backwards,n0),backwards),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
happens(push,n0),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_34])]) ).
cnf(c_0_38,plain,
forwards != backwards,
inference(split_conjunct,[status(thm)],[forwards_not_backwards]) ).
cnf(c_0_39,plain,
spinning != backwards,
inference(split_conjunct,[status(thm)],[spinning_not_backwards]) ).
cnf(c_0_40,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : CSR015+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.00/0.15 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.36 % Computer : n001.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Aug 28 07:44:04 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.23/0.59 start to proof: theBenchmark
% 0.23/0.64 % Version : CSE_E---1.5
% 0.23/0.64 % Problem : theBenchmark.p
% 0.23/0.64 % Proof found
% 0.23/0.64 % SZS status Theorem for theBenchmark.p
% 0.23/0.64 % SZS output start Proof
% See solution above
% 0.23/0.65 % Total time : 0.033000 s
% 0.23/0.65 % SZS output end Proof
% 0.23/0.65 % Total time : 0.037000 s
%------------------------------------------------------------------------------