TSTP Solution File: SWV411+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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.22s 0.48s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 7 unt; 2 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
contains_slb(insert_slb(skc4,pair(skc6,skc7)),skc5),
file('SWV411+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ contains_slb(skc4,u)
| pair_in_list(skc4,u,skf1(u)) ),
file('SWV411+1.p',unknown),
[] ).
cnf(13,axiom,
~ pair_in_list(insert_slb(skc4,pair(skc6,skc7)),skc5,u),
file('SWV411+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ pair_in_list(u,v,w)
| pair_in_list(insert_slb(u,pair(x,y)),v,w) ),
file('SWV411+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ contains_slb(insert_slb(u,pair(v,w)),x)
| contains_slb(u,x)
| equal(v,x) ),
file('SWV411+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ equal(u,v)
| ~ equal(w,x)
| pair_in_list(insert_slb(y,pair(w,u)),x,v) ),
file('SWV411+1.p',unknown),
[] ).
cnf(30,plain,
( equal(skc6,skc5)
| contains_slb(skc4,skc5) ),
inference(res,[status(thm),theory(equality)],[9,21]),
[iquote('0:Res:9.0,21.0')] ).
cnf(34,plain,
~ pair_in_list(skc4,skc5,u),
inference(res,[status(thm),theory(equality)],[20,13]),
[iquote('0:Res:20.1,13.0')] ).
cnf(35,plain,
( ~ equal(skc6,skc5)
| ~ equal(skc7,u) ),
inference(res,[status(thm),theory(equality)],[24,13]),
[iquote('0:Res:24.2,13.0')] ).
cnf(38,plain,
~ equal(skc6,skc5),
inference(aed,[status(thm),theory(equality)],[35]),
[iquote('0:AED:35.1')] ).
cnf(39,plain,
contains_slb(skc4,skc5),
inference(mrr,[status(thm)],[30,38]),
[iquote('0:MRR:30.0,38.0')] ).
cnf(41,plain,
~ contains_slb(skc4,skc5),
inference(res,[status(thm),theory(equality)],[12,34]),
[iquote('0:Res:12.1,34.0')] ).
cnf(42,plain,
$false,
inference(mrr,[status(thm)],[41,39]),
[iquote('0:MRR:41.0,39.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV411+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.15 % Command : run_spass %d %s
% 0.15/0.37 % Computer : n023.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 23:43:05 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.48
% 0.22/0.48 SPASS V 3.9
% 0.22/0.48 SPASS beiseite: Proof found.
% 0.22/0.48 % SZS status Theorem
% 0.22/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 32 clauses.
% 0.22/0.48 SPASS allocated 85217 KBytes.
% 0.22/0.48 SPASS spent 0:00:00.09 on the problem.
% 0.22/0.48 0:00:00.04 for the input.
% 0.22/0.48 0:00:00.03 for the FLOTTER CNF translation.
% 0.22/0.48 0:00:00.00 for inferences.
% 0.22/0.48 0:00:00.00 for the backtracking.
% 0.22/0.48 0:00:00.00 for the reduction.
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 Here is a proof with depth 2, length 13 :
% 0.22/0.48 % SZS output start Refutation
% See solution above
% 0.22/0.48 Formulae used in the proof : l47_co ax23 ax21
% 0.22/0.48
%------------------------------------------------------------------------------