TSTP Solution File: CSR015+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %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:24:13 EDT 2022
% Result : Theorem 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of clauses : 54 ( 17 unt; 24 nHn; 54 RR)
% Number of literals : 119 ( 0 equ; 40 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
holdsAt(backwards,n1),
file('CSR015+1.p',unknown),
[] ).
cnf(2,axiom,
~ less(u,n0),
file('CSR015+1.p',unknown),
[] ).
cnf(4,axiom,
~ holdsAt(backwards,n0),
file('CSR015+1.p',unknown),
[] ).
cnf(6,axiom,
~ releasedAt(u,v),
file('CSR015+1.p',unknown),
[] ).
cnf(7,axiom,
~ equal(pull,push),
file('CSR015+1.p',unknown),
[] ).
cnf(8,axiom,
~ equal(backwards,forwards),
file('CSR015+1.p',unknown),
[] ).
cnf(12,axiom,
equal(plus(n0,n1),n1),
file('CSR015+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ less(u,v)
| less_or_equal(u,v) ),
file('CSR015+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ equal(u,v)
| less_or_equal(u,v) ),
file('CSR015+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ less_or_equal(u,n0)
| less(u,n1) ),
file('CSR015+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ less_or_equal(u,n1)
| less(u,n2) ),
file('CSR015+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ skP7(u,v)
| equal(v,push) ),
file('CSR015+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ skP8(u,v)
| equal(v,pull) ),
file('CSR015+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ skP8(u,v)
| equal(u,n1) ),
file('CSR015+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ less(u,v)
| ~ equal(v,u) ),
file('CSR015+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ skP0(u,v,w)
| equal(v,forwards) ),
file('CSR015+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ skP1(u,v,w)
| equal(w,pull) ),
file('CSR015+1.p',unknown),
[] ).
cnf(67,axiom,
( less(u,v)
| equal(v,u)
| less(v,u) ),
file('CSR015+1.p',unknown),
[] ).
cnf(89,axiom,
( ~ happens(u,v)
| skP8(v,u)
| skP7(v,u)
| equal(v,n2) ),
file('CSR015+1.p',unknown),
[] ).
cnf(108,axiom,
( ~ initiates(u,v,w)
| equal(u,pull)
| skP0(w,v,u)
| skP1(w,v,u) ),
file('CSR015+1.p',unknown),
[] ).
cnf(114,axiom,
( ~ happens(u,v)
| equal(u,push)
| equal(u,pull)
| skP7(v,u)
| skP8(v,u) ),
file('CSR015+1.p',unknown),
[] ).
cnf(116,axiom,
( ~ holdsAt(u,plus(v,n1))
| happens(skf13(v,w),v)
| holdsAt(u,v)
| releasedAt(u,plus(v,n1)) ),
file('CSR015+1.p',unknown),
[] ).
cnf(117,axiom,
( ~ holdsAt(u,plus(v,n1))
| initiates(skf13(v,u),u,v)
| holdsAt(u,v)
| releasedAt(u,plus(v,n1)) ),
file('CSR015+1.p',unknown),
[] ).
cnf(127,plain,
( ~ happens(u,v)
| equal(u,pull)
| equal(u,push) ),
inference(mrr,[status(thm)],[114,45,47]),
[iquote('0:MRR:114.3,114.4,45.0,47.0')] ).
cnf(128,plain,
( ~ initiates(u,v,w)
| equal(u,pull)
| skP0(w,v,u) ),
inference(mrr,[status(thm)],[108,53]),
[iquote('0:MRR:108.3,53.0')] ).
cnf(129,plain,
( ~ holdsAt(u,plus(v,n1))
| holdsAt(u,v)
| happens(skf13(v,w),v) ),
inference(mrr,[status(thm)],[116,6]),
[iquote('0:MRR:116.3,6.0')] ).
cnf(131,plain,
( ~ holdsAt(u,plus(v,n1))
| holdsAt(u,v)
| initiates(skf13(v,u),u,v) ),
inference(mrr,[status(thm)],[117,6]),
[iquote('0:MRR:117.3,6.0')] ).
cnf(187,plain,
( ~ less_or_equal(u,n1)
| ~ equal(n2,u) ),
inference(res,[status(thm),theory(equality)],[28,50]),
[iquote('0:Res:28.1,50.0')] ).
cnf(188,plain,
( ~ less_or_equal(u,n0)
| ~ equal(n1,u) ),
inference(res,[status(thm),theory(equality)],[26,50]),
[iquote('0:Res:26.1,50.0')] ).
cnf(345,plain,
( equal(n0,u)
| less(n0,u) ),
inference(res,[status(thm),theory(equality)],[67,2]),
[iquote('0:Res:67.0,2.0')] ).
cnf(399,plain,
( equal(n0,u)
| less_or_equal(n0,u) ),
inference(res,[status(thm),theory(equality)],[345,23]),
[iquote('0:Res:345.1,23.0')] ).
cnf(406,plain,
less_or_equal(n0,u),
inference(mrr,[status(thm)],[399,24]),
[iquote('0:MRR:399.0,24.0')] ).
cnf(414,plain,
~ equal(n2,n0),
inference(res,[status(thm),theory(equality)],[406,187]),
[iquote('0:Res:406.0,187.0')] ).
cnf(415,plain,
~ equal(n1,n0),
inference(res,[status(thm),theory(equality)],[406,188]),
[iquote('0:Res:406.0,188.0')] ).
cnf(682,plain,
( ~ initiates(u,v,w)
| equal(u,pull)
| equal(v,forwards) ),
inference(res,[status(thm),theory(equality)],[128,52]),
[iquote('0:Res:128.2,52.0')] ).
cnf(692,plain,
( ~ happens(u,v)
| skP7(v,u)
| equal(v,n2)
| equal(v,n1) ),
inference(res,[status(thm),theory(equality)],[89,48]),
[iquote('0:Res:89.1,48.0')] ).
cnf(710,plain,
( ~ holdsAt(u,n1)
| holdsAt(u,n0)
| happens(skf13(n0,v),n0) ),
inference(spl,[status(thm),theory(equality)],[12,129]),
[iquote('0:SpL:12.0,129.0')] ).
cnf(5929,plain,
( ~ holdsAt(u,n1)
| holdsAt(u,n0) ),
inference(spt,[spt(split,[position(s1)])],[710]),
[iquote('1:Spt:710.0,710.1')] ).
cnf(5930,plain,
holdsAt(backwards,n0),
inference(res,[status(thm),theory(equality)],[1,5929]),
[iquote('1:Res:1.0,5929.0')] ).
cnf(5931,plain,
$false,
inference(mrr,[status(thm)],[5930,4]),
[iquote('1:MRR:5930.0,4.0')] ).
cnf(5932,plain,
happens(skf13(n0,u),n0),
inference(spt,[spt(split,[position(s2)])],[710]),
[iquote('1:Spt:5931.0,710.2')] ).
cnf(5933,plain,
( equal(skf13(n0,u),pull)
| equal(skf13(n0,u),push) ),
inference(res,[status(thm),theory(equality)],[5932,127]),
[iquote('1:Res:5932.0,127.0')] ).
cnf(5936,plain,
( equal(skf13(n0,u),push)
| happens(pull,n0) ),
inference(spr,[status(thm),theory(equality)],[5933,5932]),
[iquote('1:SpR:5933.0,5932.0')] ).
cnf(5939,plain,
equal(skf13(n0,u),push),
inference(spt,[spt(split,[position(s2s1)])],[5936]),
[iquote('2:Spt:5936.0')] ).
cnf(5941,plain,
( ~ holdsAt(u,plus(n0,n1))
| holdsAt(u,n0)
| initiates(push,u,n0) ),
inference(spr,[status(thm),theory(equality)],[5939,131]),
[iquote('2:SpR:5939.0,131.2')] ).
cnf(5943,plain,
( ~ holdsAt(u,n1)
| holdsAt(u,n0)
| initiates(push,u,n0) ),
inference(rew,[status(thm),theory(equality)],[12,5941]),
[iquote('2:Rew:12.0,5941.0')] ).
cnf(6010,plain,
( ~ holdsAt(u,n1)
| holdsAt(u,n0)
| equal(pull,push)
| equal(u,forwards) ),
inference(res,[status(thm),theory(equality)],[5943,682]),
[iquote('2:Res:5943.2,682.0')] ).
cnf(6014,plain,
( ~ holdsAt(u,n1)
| holdsAt(u,n0)
| equal(u,forwards) ),
inference(mrr,[status(thm)],[6010,7]),
[iquote('2:MRR:6010.2,7.0')] ).
cnf(6017,plain,
( holdsAt(backwards,n0)
| equal(backwards,forwards) ),
inference(res,[status(thm),theory(equality)],[1,6014]),
[iquote('2:Res:1.0,6014.0')] ).
cnf(6018,plain,
$false,
inference(mrr,[status(thm)],[6017,4,8]),
[iquote('2:MRR:6017.0,6017.1,4.0,8.0')] ).
cnf(6019,plain,
happens(pull,n0),
inference(spt,[spt(split,[position(s2s2)])],[5936]),
[iquote('2:Spt:6018.0,5936.1')] ).
cnf(6668,plain,
( ~ happens(u,v)
| equal(v,n2)
| equal(v,n1)
| equal(u,push) ),
inference(res,[status(thm),theory(equality)],[692,45]),
[iquote('0:Res:692.1,45.0')] ).
cnf(7972,plain,
( equal(n2,n0)
| equal(n1,n0)
| equal(pull,push) ),
inference(res,[status(thm),theory(equality)],[6019,6668]),
[iquote('2:Res:6019.0,6668.0')] ).
cnf(7974,plain,
$false,
inference(mrr,[status(thm)],[7972,414,415,7]),
[iquote('2:MRR:7972.0,7972.1,7972.2,414.0,415.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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:32:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.60/0.79
% 0.60/0.79 SPASS V 3.9
% 0.60/0.79 SPASS beiseite: Proof found.
% 0.60/0.79 % SZS status Theorem
% 0.60/0.79 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.79 SPASS derived 7232 clauses, backtracked 5 clauses, performed 10 splits and kept 702 clauses.
% 0.60/0.79 SPASS allocated 88733 KBytes.
% 0.60/0.79 SPASS spent 0:00:00.42 on the problem.
% 0.60/0.79 0:00:00.04 for the input.
% 0.60/0.79 0:00:00.09 for the FLOTTER CNF translation.
% 0.60/0.79 0:00:00.07 for inferences.
% 0.60/0.79 0:00:00.00 for the backtracking.
% 0.60/0.79 0:00:00.19 for the reduction.
% 0.60/0.79
% 0.60/0.79
% 0.60/0.79 Here is a proof with depth 8, length 54 :
% 0.60/0.79 % SZS output start Refutation
% See solution above
% 0.60/0.79 Formulae used in the proof : not_backwards_1 less0 not_backwards_0 not_releasedAt push_not_pull forwards_not_backwards plus0_1 less_or_equal less1 less2 happens_all_defn less_property initiates_all_defn keep_not_holding
% 0.60/0.79
%------------------------------------------------------------------------------