TSTP Solution File: SWV416+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV416+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:43 EDT 2022
% Result : Theorem 0.62s 0.86s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 20 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
pi_remove(triple(skc4,skc5,skc6),skc7),
file('SWV416+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ pi_sharp_remove(u,v)
| contains_pq(u,v) ),
file('SWV416+1.p',unknown),
[] ).
cnf(39,axiom,
( ~ pi_remove(u,v)
| pi_sharp_remove(i(u),v) ),
file('SWV416+1.p',unknown),
[] ).
cnf(54,axiom,
equal(i(triple(u,v,w)),i(triple(x,v,y))),
file('SWV416+1.p',unknown),
[] ).
cnf(86,axiom,
( ~ contains_pq(i(triple(u,v,w)),x)
| equal(remove_pq(i(triple(u,v,w)),x),i(remove_cpq(triple(u,v,w),x))) ),
file('SWV416+1.p',unknown),
[] ).
cnf(87,axiom,
( ~ pi_sharp_remove(i(triple(skc4,skc5,skc6)),skc7)
| ~ equal(remove_pq(i(triple(skc4,skc5,skc6)),skc7),i(remove_cpq(triple(skc4,skc5,skc6),skc7))) ),
file('SWV416+1.p',unknown),
[] ).
cnf(191,plain,
( ~ pi_remove(triple(u,v,w),x)
| pi_sharp_remove(i(triple(y,v,z)),x) ),
inference(spr,[status(thm),theory(equality)],[54,39]),
[iquote('0:SpR:54.0,39.1')] ).
cnf(454,plain,
pi_sharp_remove(i(triple(u,skc5,v)),skc7),
inference(res,[status(thm),theory(equality)],[14,191]),
[iquote('0:Res:14.0,191.0')] ).
cnf(458,plain,
~ equal(remove_pq(i(triple(skc4,skc5,skc6)),skc7),i(remove_cpq(triple(skc4,skc5,skc6),skc7))),
inference(mrr,[status(thm)],[87,454]),
[iquote('0:MRR:87.0,454.0')] ).
cnf(461,plain,
contains_pq(i(triple(u,skc5,v)),skc7),
inference(res,[status(thm),theory(equality)],[454,25]),
[iquote('0:Res:454.0,25.0')] ).
cnf(472,plain,
~ equal(remove_pq(i(triple(u,skc5,v)),skc7),i(remove_cpq(triple(skc4,skc5,skc6),skc7))),
inference(spl,[status(thm),theory(equality)],[54,458]),
[iquote('0:SpL:54.0,458.0')] ).
cnf(1143,plain,
( ~ contains_pq(i(triple(u,skc5,v)),skc7)
| ~ equal(i(remove_cpq(triple(u,skc5,v),skc7)),i(remove_cpq(triple(skc4,skc5,skc6),skc7))) ),
inference(spl,[status(thm),theory(equality)],[86,472]),
[iquote('0:SpL:86.1,472.0')] ).
cnf(1145,plain,
~ equal(i(remove_cpq(triple(u,skc5,v),skc7)),i(remove_cpq(triple(skc4,skc5,skc6),skc7))),
inference(mrr,[status(thm)],[1143,461]),
[iquote('0:MRR:1143.0,461.0')] ).
cnf(1641,plain,
$false,
inference(eqr,[status(thm),theory(equality)],[1145]),
[iquote('0:EqR:1145.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV416+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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 : Tue Jun 14 15:34:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.62/0.86
% 0.62/0.86 SPASS V 3.9
% 0.62/0.86 SPASS beiseite: Proof found.
% 0.62/0.86 % SZS status Theorem
% 0.62/0.86 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.62/0.86 SPASS derived 1428 clauses, backtracked 0 clauses, performed 0 splits and kept 790 clauses.
% 0.62/0.86 SPASS allocated 99574 KBytes.
% 0.62/0.86 SPASS spent 0:00:00.50 on the problem.
% 0.62/0.86 0:00:00.04 for the input.
% 0.62/0.86 0:00:00.05 for the FLOTTER CNF translation.
% 0.62/0.86 0:00:00.03 for inferences.
% 0.62/0.86 0:00:00.00 for the backtracking.
% 0.62/0.86 0:00:00.36 for the reduction.
% 0.62/0.86
% 0.62/0.86
% 0.62/0.86 Here is a proof with depth 3, length 14 :
% 0.62/0.86 % SZS output start Refutation
% See solution above
% 0.62/0.86 Formulae used in the proof : co3 ax56 ax57 main3_li12 main3_li34
% 0.62/0.86
%------------------------------------------------------------------------------