TSTP Solution File: SWV415+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV415+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:42 EDT 2022
% Result : Theorem 0.40s 0.56s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 8 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(52,axiom,
equal(i(triple(u,v,w)),i(triple(x,v,y))),
file('SWV415+1.p',unknown),
[] ).
cnf(71,axiom,
~ equal(insert_pq(i(triple(skc7,skc6,skc5)),skc4),i(insert_cpq(triple(skc7,skc6,skc5),skc4))),
file('SWV415+1.p',unknown),
[] ).
cnf(75,axiom,
equal(triple(insert_pqp(u,v),insert_slb(w,pair(v,bottom)),x),insert_cpq(triple(u,w,x),v)),
file('SWV415+1.p',unknown),
[] ).
cnf(76,axiom,
equal(i(triple(u,insert_slb(v,pair(w,x)),y)),insert_pq(i(triple(u,v,y)),w)),
file('SWV415+1.p',unknown),
[] ).
cnf(415,plain,
~ equal(insert_pq(i(triple(u,skc6,v)),skc4),i(insert_cpq(triple(skc7,skc6,skc5),skc4))),
inference(spl,[status(thm),theory(equality)],[52,71]),
[iquote('0:SpL:52.0,71.0')] ).
cnf(877,plain,
equal(i(insert_cpq(triple(u,v,w),x)),i(triple(y,insert_slb(v,pair(x,bottom)),z))),
inference(spr,[status(thm),theory(equality)],[75,52]),
[iquote('0:SpR:75.0,52.0')] ).
cnf(900,plain,
equal(i(insert_cpq(triple(u,v,w),x)),insert_pq(i(triple(y,v,z)),x)),
inference(rew,[status(thm),theory(equality)],[76,877]),
[iquote('0:Rew:76.0,877.0')] ).
cnf(901,plain,
$false,
inference(unc,[status(thm)],[900,415]),
[iquote('0:UnC:900.0,415.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV415+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 22:03:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.40/0.56
% 0.40/0.56 SPASS V 3.9
% 0.40/0.56 SPASS beiseite: Proof found.
% 0.40/0.56 % SZS status Theorem
% 0.40/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.56 SPASS derived 732 clauses, backtracked 0 clauses, performed 0 splits and kept 301 clauses.
% 0.40/0.56 SPASS allocated 98402 KBytes.
% 0.40/0.56 SPASS spent 0:00:00.20 on the problem.
% 0.40/0.56 0:00:00.04 for the input.
% 0.40/0.56 0:00:00.05 for the FLOTTER CNF translation.
% 0.40/0.56 0:00:00.01 for inferences.
% 0.40/0.56 0:00:00.00 for the backtracking.
% 0.40/0.56 0:00:00.08 for the reduction.
% 0.40/0.56
% 0.40/0.56
% 0.40/0.56 Here is a proof with depth 1, length 8 :
% 0.40/0.56 % SZS output start Refutation
% See solution above
% 0.40/0.56 Formulae used in the proof : main2_l12 co2 ax42 ax55
% 0.40/0.56
%------------------------------------------------------------------------------