TSTP Solution File: SWV366+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV366+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:32 EDT 2022
% Result : Theorem 0.22s 0.53s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 6 ( 0 equ; 3 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 : 17 ( 17 usr; 12 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(52,axiom,
equal(i(triple(u,skc7,v)),i(triple(w,skc7,x))),
file('SWV366+1.p',unknown),
[] ).
cnf(75,axiom,
equal(i(triple(u,insert_slb(v,pair(w,x)),y)),insert_pq(i(triple(u,v,y)),w)),
file('SWV366+1.p',unknown),
[] ).
cnf(83,axiom,
~ equal(i(triple(skc13,insert_slb(skc7,pair(skc9,skc8)),skc11)),i(triple(skc12,insert_slb(skc7,pair(skc9,skc8)),skc10))),
file('SWV366+1.p',unknown),
[] ).
cnf(93,plain,
~ equal(insert_pq(i(triple(skc13,skc7,skc11)),skc9),insert_pq(i(triple(skc12,skc7,skc10)),skc9)),
inference(rew,[status(thm),theory(equality)],[75,83]),
[iquote('0:Rew:75.0,83.0,75.0,83.0')] ).
cnf(408,plain,
~ equal(insert_pq(i(triple(u,skc7,v)),skc9),insert_pq(i(triple(skc12,skc7,skc10)),skc9)),
inference(spl,[status(thm),theory(equality)],[52,93]),
[iquote('0:SpL:52.0,93.0')] ).
cnf(410,plain,
$false,
inference(obv,[status(thm),theory(equality)],[408]),
[iquote('0:Obv:408.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SWV366+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.15 % Command : run_spass %d %s
% 0.15/0.37 % Computer : n024.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Wed Jun 15 05:30:33 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.53
% 0.22/0.53 SPASS V 3.9
% 0.22/0.53 SPASS beiseite: Proof found.
% 0.22/0.53 % SZS status Theorem
% 0.22/0.53 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.53 SPASS derived 275 clauses, backtracked 0 clauses, performed 0 splits and kept 191 clauses.
% 0.22/0.53 SPASS allocated 98086 KBytes.
% 0.22/0.53 SPASS spent 0:00:00.14 on the problem.
% 0.22/0.53 0:00:00.04 for the input.
% 0.22/0.53 0:00:00.05 for the FLOTTER CNF translation.
% 0.22/0.53 0:00:00.01 for inferences.
% 0.22/0.53 0:00:00.00 for the backtracking.
% 0.22/0.53 0:00:00.02 for the reduction.
% 0.22/0.53
% 0.22/0.53
% 0.22/0.53 Here is a proof with depth 1, length 6 :
% 0.22/0.53 % SZS output start Refutation
% See solution above
% 0.22/0.53 Formulae used in the proof : l2_co ax55
% 0.22/0.53
%------------------------------------------------------------------------------