%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : CSR020+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n021.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 23:15:00 EDT 2022
% Result : Theorem 12.98s 2.05s
% Output : Proof 12.98s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
holdsAt(spinning,n2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_spinning_2)]) ).
cnf(g1,plain,
sPE(n2,n2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(spinning,spinning),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(n0,n2)
| sPE(n2,n0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(n2,n0)
| less_or_equal(n2,n0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal)]) ).
cnf(g5,plain,
( ~ sPE(pull,pull)
| ~ sPE(n2,n2)
| happens(pull,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g6,plain,
( ~ sPE(n2,plus(n0,n1))
| ~ less(plus(n0,n1),n2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property)]) ).
cnf(g7,plain,
( ~ sPE(plus(n0,n1),n2)
| sPE(n2,plus(n0,n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(n0,n0),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
sPE(plus(n1,n1),n2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1)]) ).
cnf(g10,plain,
sPE(plus(n2,n1),plus(n2,n1)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(spinning,backwards)
| ~ sPE(plus(n2,n1),plus(n2,n1))
| ~ holdsAt(spinning,plus(n2,n1))
| holdsAt(backwards,plus(n2,n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
sPE(backwards,backwards),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(push,push)
| ~ sPE(n2,n2)
| happens(push,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g14,plain,
sPE(push,push),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(pull,push)
| sPE(push,pull) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
sPE(pull,pull),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
sPE(n1,n1),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ less_or_equal(n2,n0)
| less(n2,n1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1)]) ).
cnf(g19,plain,
( ~ holdsAt(spinning,plus(plus(n0,n1),n1))
| initiates(sK5(spinning,plus(n0,n1)),spinning,plus(n0,n1))
| holdsAt(spinning,plus(n0,n1))
| releasedAt(spinning,plus(plus(n0,n1),n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',keep_not_holding)]) ).
cnf(g20,plain,
( ~ holdsAt(spinning,plus(plus(n0,n1),n1))
| happens(sK5(spinning,plus(n0,n1)),plus(n0,n1))
| holdsAt(spinning,plus(n0,n1))
| releasedAt(spinning,plus(plus(n0,n1),n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',keep_not_holding)]) ).
cnf(g21,plain,
( ~ sPE(pull,pull)
| ~ sPE(spinning,spinning)
| ~ happens(push,n2)
| initiates(pull,spinning,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',initiates_all_defn)]) ).
cnf(g22,plain,
( ~ sPE(n0,n1)
| sPE(n1,n0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
sPE(plus(n0,n1),n1),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1)]) ).
cnf(g24,plain,
( ~ less_or_equal(plus(n0,n1),n1)
| less(plus(n0,n1),n2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2)]) ).
cnf(g25,plain,
( ~ less_or_equal(n2,n1)
| less(n2,n2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2)]) ).
cnf(g26,plain,
( ~ sPE(plus(plus(n0,n1),n1),n2)
| sPE(n2,plus(plus(n0,n1),n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(plus(plus(n0,n1),n1),plus(n1,n1))
| ~ sPE(plus(n1,n1),n2)
| sPE(plus(plus(n0,n1),n1),n2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(plus(n0,n1),n1)
| ~ sPE(n1,n1)
| sPE(plus(plus(n0,n1),n1),plus(n1,n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ happens(pull,n2)
| ~ initiates(pull,spinning,n2)
| holdsAt(spinning,plus(n2,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_holds)]) ).
cnf(g30,plain,
( ~ sPE(pull,pull)
| ~ sPE(backwards,backwards)
| ~ happens(push,n2)
| terminates(pull,backwards,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',terminates_all_defn)]) ).
cnf(g31,plain,
( ~ happens(pull,n2)
| ~ terminates(pull,backwards,n2)
| ~ holdsAt(backwards,plus(n2,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_terminates_not_holds)]) ).
cnf(g32,plain,
( ~ less(n2,n1)
| less_or_equal(n2,n1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal)]) ).
cnf(g33,plain,
( sPE(n0,n2)
| ~ sP8(pull,n0) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g34,plain,
( ~ happens(pull,n0)
| sPE(pull,push)
| sP7(pull,n0)
| sP8(pull,n0)
| sP9(pull,n0) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g35,plain,
( sPE(n0,n2)
| ~ sP9(pull,n0) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g36,plain,
( ~ less_or_equal(n0,n0)
| less(n0,n1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1)]) ).
cnf(g37,plain,
( ~ sPE(n1,n0)
| ~ less(n0,n1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property)]) ).
cnf(g38,plain,
( sPE(plus(n0,n1),n2)
| ~ sP8(push,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g39,plain,
( ~ happens(push,plus(n0,n1))
| sPE(plus(n0,n1),n0)
| sP7(push,plus(n0,n1))
| sP8(push,plus(n0,n1))
| sP9(push,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g40,plain,
( sPE(plus(n0,n1),n2)
| ~ sP9(push,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g41,plain,
( ~ sPE(plus(n0,n1),n1)
| less_or_equal(plus(n0,n1),n1) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal)]) ).
cnf(g42,plain,
( ~ sPE(n2,n2)
| ~ less(n2,n2) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property)]) ).
cnf(g43,plain,
( ~ sPE(n0,n0)
| less_or_equal(n0,n0) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal)]) ).
cnf(g44,plain,
( ~ sPE(pull,pull)
| ~ sPE(plus(n0,n1),n1)
| happens(pull,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g45,plain,
( ~ happens(pull,plus(n0,n1))
| ~ terminates(pull,spinning,plus(n0,n1))
| ~ holdsAt(spinning,plus(plus(n0,n1),n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_terminates_not_holds)]) ).
cnf(g46,plain,
( ~ sPE(pull,pull)
| ~ sPE(spinning,spinning)
| happens(push,plus(n0,n1))
| terminates(pull,spinning,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',terminates_all_defn)]) ).
cnf(g47,plain,
( sPE(sK5(spinning,plus(n0,n1)),pull)
| ~ sP1(sK5(spinning,plus(n0,n1)),spinning,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',initiates_all_defn)]) ).
cnf(g48,plain,
~ releasedAt(spinning,plus(plus(n0,n1),n1)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_releasedAt)]) ).
cnf(g49,plain,
( sPE(spinning,backwards)
| ~ sP0(sK5(spinning,plus(n0,n1)),spinning,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',initiates_all_defn)]) ).
cnf(g50,plain,
( sPE(n0,n1)
| ~ sP7(pull,n0) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g51,plain,
~ sPE(push,pull),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',push_not_pull)]) ).
cnf(g52,plain,
( ~ sPE(spinning,spinning)
| ~ sPE(n2,plus(plus(n0,n1),n1))
| ~ holdsAt(spinning,n2)
| holdsAt(spinning,plus(plus(n0,n1),n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g53,plain,
( ~ sPE(push,push)
| ~ sPE(n0,n0)
| happens(push,n0) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g54,plain,
( ~ sPE(push,push)
| ~ sPE(spinning,spinning)
| happens(pull,n0)
| terminates(push,spinning,n0) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',terminates_all_defn)]) ).
cnf(g55,plain,
( ~ happens(push,n0)
| ~ terminates(push,spinning,n0)
| ~ holdsAt(spinning,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_terminates_not_holds)]) ).
cnf(g56,plain,
( ~ happens(pull,plus(n0,n1))
| ~ initiates(sK5(spinning,plus(n0,n1)),spinning,plus(n0,n1))
| sP0(sK5(spinning,plus(n0,n1)),spinning,plus(n0,n1))
| sP1(sK5(spinning,plus(n0,n1)),spinning,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',initiates_all_defn)]) ).
cnf(g57,plain,
( ~ sPE(sK5(spinning,plus(n0,n1)),pull)
| ~ sPE(plus(n0,n1),n0)
| ~ happens(sK5(spinning,plus(n0,n1)),plus(n0,n1))
| happens(pull,n0) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g58,plain,
( sPE(push,pull)
| ~ sP7(push,plus(n0,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR020+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 10 01:22:53 EDT 2022
% 0.13/0.33 % CPUTime :
% 12.98/2.05 % symbols: 48
% 12.98/2.05 % clauses: 153
% 12.98/2.05 % start clauses: 1
% 12.98/2.05 % iterative deepening steps: 1107
% 12.98/2.05 % maximum path limit: 5
% 12.98/2.05 % literal attempts: 2285065
% 12.98/2.05 % depth failures: 1830340
% 12.98/2.05 % regularity failures: 107242
% 12.98/2.05 % tautology failures: 99685
% 12.98/2.05 % reductions: 14335
% 12.98/2.05 % extensions: 2270383
% 12.98/2.05 % SAT variables: 128677
% 12.98/2.05 % SAT clauses: 195647
% 12.98/2.05 % WalkSAT solutions: 195387
% 12.98/2.05 % CDCL solutions: 255
% 12.98/2.05 % SZS status Theorem for theBenchmark
% 12.98/2.05 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------