TSTP Solution File: SET019-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET019-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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 : Tue Jul 19 05:22:40 EDT 2022
% Result : Unsatisfiable 0.93s 1.17s
% Output : Refutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 11 unt; 2 nHn; 18 RR)
% Number of literals : 28 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
subset(b,a),
file('SET019-3.p',unknown),
[] ).
cnf(5,axiom,
subset(a,b),
file('SET019-3.p',unknown),
[] ).
cnf(6,axiom,
~ equal(a,b),
file('SET019-3.p',unknown),
[] ).
cnf(9,axiom,
( equal(u,v)
| member(f1(u,v),v)
| member(f1(u,v),u) ),
file('SET019-3.p',unknown),
[] ).
cnf(10,axiom,
( ~ member(f1(u,v),v)
| ~ member(f1(u,v),u)
| equal(u,v) ),
file('SET019-3.p',unknown),
[] ).
cnf(73,axiom,
( ~ member(u,v)
| ~ subset(v,w)
| member(u,w) ),
file('SET019-3.p',unknown),
[] ).
cnf(160,plain,
( ~ member(f1(b,a),a)
| ~ member(f1(b,a),b) ),
inference(res,[status(thm),theory(equality)],[10,6]),
[iquote('0:Res:10.2,6.0')] ).
cnf(161,plain,
( member(f1(b,a),a)
| member(f1(b,a),b) ),
inference(res,[status(thm),theory(equality)],[9,6]),
[iquote('0:Res:9.2,6.0')] ).
cnf(419,plain,
member(f1(b,a),a),
inference(spt,[spt(split,[position(s1)])],[161]),
[iquote('1:Spt:161.0')] ).
cnf(420,plain,
~ member(f1(b,a),b),
inference(mrr,[status(thm)],[160,419]),
[iquote('1:MRR:160.0,419.0')] ).
cnf(1239,plain,
( ~ subset(a,u)
| member(f1(b,a),u) ),
inference(res,[status(thm),theory(equality)],[419,73]),
[iquote('1:Res:419.0,73.0')] ).
cnf(1503,plain,
~ subset(a,b),
inference(res,[status(thm),theory(equality)],[1239,420]),
[iquote('1:Res:1239.1,420.0')] ).
cnf(1504,plain,
$false,
inference(mrr,[status(thm)],[1503,5]),
[iquote('1:MRR:1503.0,5.0')] ).
cnf(1505,plain,
~ member(f1(b,a),a),
inference(spt,[spt(split,[position(sa)])],[1504,419]),
[iquote('1:Spt:1504.0,161.0,419.0')] ).
cnf(1506,plain,
member(f1(b,a),b),
inference(spt,[spt(split,[position(s2)])],[161]),
[iquote('1:Spt:1504.0,161.1')] ).
cnf(1507,plain,
( ~ subset(b,u)
| member(f1(b,a),u) ),
inference(res,[status(thm),theory(equality)],[1506,73]),
[iquote('1:Res:1506.0,73.0')] ).
cnf(3116,plain,
~ subset(b,a),
inference(res,[status(thm),theory(equality)],[1507,1505]),
[iquote('1:Res:1507.1,1505.0')] ).
cnf(3117,plain,
$false,
inference(mrr,[status(thm)],[3116,4]),
[iquote('1:MRR:3116.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET019-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 23:38:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.93/1.17
% 0.93/1.17 SPASS V 3.9
% 0.93/1.17 SPASS beiseite: Proof found.
% 0.93/1.17 % SZS status Theorem
% 0.93/1.17 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.93/1.17 SPASS derived 2470 clauses, backtracked 1128 clauses, performed 10 splits and kept 2813 clauses.
% 0.93/1.17 SPASS allocated 78571 KBytes.
% 0.93/1.17 SPASS spent 0:00:00.80 on the problem.
% 0.93/1.17 0:00:00.04 for the input.
% 0.93/1.17 0:00:00.00 for the FLOTTER CNF translation.
% 0.93/1.17 0:00:00.03 for inferences.
% 0.93/1.17 0:00:00.02 for the backtracking.
% 0.93/1.17 0:00:00.66 for the reduction.
% 0.93/1.17
% 0.93/1.17
% 0.93/1.17 Here is a proof with depth 4, length 18 :
% 0.93/1.17 % SZS output start Refutation
% See solution above
% 0.93/1.17 Formulae used in the proof : a_contains_b b_contains_a prove__a_equals_b extensionality2 extensionality3 subset1
% 0.93/1.17
%------------------------------------------------------------------------------