TSTP Solution File: SWV372+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV372+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 : Wed Jul 20 21:42:33 EDT 2022
% Result : Theorem 0.48s 0.69s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 13 unt; 6 nHn; 23 RR)
% Number of literals : 37 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(13,axiom,
equal(findmin_cpq_res(u),removemin_cpq_res(u)),
file('SWV372+1.p',unknown),
[] ).
cnf(14,axiom,
phi(findmin_cpq_eff(triple(skc3,skc4,skc5))),
file('SWV372+1.p',unknown),
[] ).
cnf(17,axiom,
~ ok(triple(u,v,bad)),
file('SWV372+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ contains_slb(u,v)
| contains_cpq(triple(w,u,x),v) ),
file('SWV372+1.p',unknown),
[] ).
cnf(52,axiom,
equal(findmin_cpq_eff(triple(u,create_slb,v)),triple(u,create_slb,bad)),
file('SWV372+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ phi(triple(u,v,w))
| ok(triple(u,v,w)) ),
file('SWV372+1.p',unknown),
[] ).
cnf(59,axiom,
( equal(findmin_cpq_res(triple(u,v,w)),findmin_pqp_res(u))
| equal(v,create_slb) ),
file('SWV372+1.p',unknown),
[] ).
cnf(62,axiom,
~ contains_pq(i(triple(skc3,skc4,skc5)),findmin_cpq_res(triple(skc3,skc4,skc5))),
file('SWV372+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ contains_cpq(triple(u,v,w),x)
| contains_pq(i(triple(u,v,w)),x) ),
file('SWV372+1.p',unknown),
[] ).
cnf(87,axiom,
( equal(u,create_slb)
| contains_slb(u,findmin_pqp_res(v))
| equal(findmin_cpq_eff(triple(v,u,w)),triple(v,update_slb(u,findmin_pqp_res(v)),bad)) ),
file('SWV372+1.p',unknown),
[] ).
cnf(95,plain,
( equal(u,create_slb)
| equal(removemin_cpq_res(triple(v,u,w)),findmin_pqp_res(v)) ),
inference(rew,[status(thm),theory(equality)],[13,59]),
[iquote('0:Rew:13.0,59.0')] ).
cnf(96,plain,
~ contains_pq(i(triple(skc3,skc4,skc5)),removemin_cpq_res(triple(skc3,skc4,skc5))),
inference(rew,[status(thm),theory(equality)],[13,62]),
[iquote('0:Rew:13.0,62.0')] ).
cnf(106,plain,
~ contains_cpq(triple(skc3,skc4,skc5),removemin_cpq_res(triple(skc3,skc4,skc5))),
inference(res,[status(thm),theory(equality)],[69,96]),
[iquote('0:Res:69.1,96.0')] ).
cnf(167,plain,
~ contains_slb(skc4,removemin_cpq_res(triple(skc3,skc4,skc5))),
inference(res,[status(thm),theory(equality)],[51,106]),
[iquote('0:Res:51.1,106.0')] ).
cnf(172,plain,
( ~ contains_slb(skc4,findmin_pqp_res(skc3))
| equal(skc4,create_slb) ),
inference(spl,[status(thm),theory(equality)],[95,167]),
[iquote('0:SpL:95.1,167.0')] ).
cnf(1025,plain,
( ~ phi(findmin_cpq_eff(triple(u,v,w)))
| equal(v,create_slb)
| contains_slb(v,findmin_pqp_res(u))
| ok(triple(u,update_slb(v,findmin_pqp_res(u)),bad)) ),
inference(spl,[status(thm),theory(equality)],[87,53]),
[iquote('0:SpL:87.2,53.0')] ).
cnf(1037,plain,
( ~ phi(findmin_cpq_eff(triple(u,v,w)))
| equal(v,create_slb)
| contains_slb(v,findmin_pqp_res(u)) ),
inference(mrr,[status(thm)],[1025,17]),
[iquote('0:MRR:1025.3,17.0')] ).
cnf(1046,plain,
( equal(skc4,create_slb)
| contains_slb(skc4,findmin_pqp_res(skc3)) ),
inference(res,[status(thm),theory(equality)],[14,1037]),
[iquote('0:Res:14.0,1037.0')] ).
cnf(1048,plain,
equal(skc4,create_slb),
inference(mrr,[status(thm)],[1046,172]),
[iquote('0:MRR:1046.1,172.0')] ).
cnf(1049,plain,
phi(findmin_cpq_eff(triple(skc3,create_slb,skc5))),
inference(rew,[status(thm),theory(equality)],[1048,14]),
[iquote('0:Rew:1048.0,14.0')] ).
cnf(1058,plain,
phi(triple(skc3,create_slb,bad)),
inference(rew,[status(thm),theory(equality)],[52,1049]),
[iquote('0:Rew:52.0,1049.0')] ).
cnf(1067,plain,
ok(triple(skc3,create_slb,bad)),
inference(res,[status(thm),theory(equality)],[1058,53]),
[iquote('0:Res:1058.0,53.0')] ).
cnf(1068,plain,
$false,
inference(mrr,[status(thm)],[1067,17]),
[iquote('0:MRR:1067.0,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWV372+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 15:24:16 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.48/0.69
% 0.48/0.69 SPASS V 3.9
% 0.48/0.69 SPASS beiseite: Proof found.
% 0.48/0.69 % SZS status Theorem
% 0.48/0.69 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.69 SPASS derived 869 clauses, backtracked 0 clauses, performed 0 splits and kept 436 clauses.
% 0.48/0.69 SPASS allocated 98707 KBytes.
% 0.48/0.69 SPASS spent 0:00:00.31 on the problem.
% 0.48/0.69 0:00:00.04 for the input.
% 0.48/0.69 0:00:00.05 for the FLOTTER CNF translation.
% 0.48/0.69 0:00:00.02 for inferences.
% 0.48/0.69 0:00:00.00 for the backtracking.
% 0.48/0.69 0:00:00.17 for the reduction.
% 0.48/0.69
% 0.48/0.69
% 0.48/0.69 Here is a proof with depth 3, length 23 :
% 0.48/0.69 % SZS output start Refutation
% See solution above
% 0.48/0.69 Formulae used in the proof : ax53 l8_co ax40 ax39 ax46 l8_lX ax51 l8_li56 ax47
% 0.48/0.69
%------------------------------------------------------------------------------