TSTP Solution File: SEU321+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU321+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 : Tue Jul 19 14:36:14 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 11 unt; 3 nHn; 20 RR)
% Number of literals : 37 ( 0 equ; 18 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
one_sorted_str(skc6),
file('SEU321+1.p',unknown),
[] ).
cnf(9,axiom,
empty(empty_set),
file('SEU321+1.p',unknown),
[] ).
cnf(15,axiom,
~ empty_carrier(skc6),
file('SEU321+1.p',unknown),
[] ).
cnf(19,axiom,
element(skc8,the_carrier(skc6)),
file('SEU321+1.p',unknown),
[] ).
cnf(21,axiom,
element(skc7,powerset(the_carrier(skc6))),
file('SEU321+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ one_sorted_str(u)
| ~ empty(the_carrier(u))
| empty_carrier(u) ),
file('SEU321+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ in(skc8,skc7)
| in(skc8,subset_complement(the_carrier(skc6),skc7)) ),
file('SEU321+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ in(skc8,subset_complement(the_carrier(skc6),skc7))
| in(skc8,skc7) ),
file('SEU321+1.p',unknown),
[] ).
cnf(78,axiom,
( ~ in(u,v)
| ~ element(v,powerset(w))
| ~ in(u,subset_complement(w,v)) ),
file('SEU321+1.p',unknown),
[] ).
cnf(79,axiom,
( ~ element(u,v)
| ~ element(w,powerset(v))
| in(u,w)
| equal(v,empty_set)
| in(u,subset_complement(v,w)) ),
file('SEU321+1.p',unknown),
[] ).
cnf(81,plain,
( ~ empty(the_carrier(skc6))
| empty_carrier(skc6) ),
inference(res,[status(thm),theory(equality)],[1,56]),
[iquote('0:Res:1.0,56.0')] ).
cnf(134,plain,
( ~ element(u,the_carrier(skc6))
| equal(the_carrier(skc6),empty_set)
| in(u,skc7)
| in(u,subset_complement(the_carrier(skc6),skc7)) ),
inference(res,[status(thm),theory(equality)],[21,79]),
[iquote('0:Res:21.0,79.0')] ).
cnf(135,plain,
( ~ in(u,subset_complement(the_carrier(skc6),skc7))
| ~ in(u,skc7) ),
inference(res,[status(thm),theory(equality)],[21,78]),
[iquote('0:Res:21.0,78.0')] ).
cnf(141,plain,
~ empty(the_carrier(skc6)),
inference(mrr,[status(thm)],[81,15]),
[iquote('0:MRR:81.1,15.0')] ).
cnf(143,plain,
~ in(skc8,skc7),
inference(mrr,[status(thm)],[57,135]),
[iquote('0:MRR:57.1,135.0')] ).
cnf(144,plain,
~ in(skc8,subset_complement(the_carrier(skc6),skc7)),
inference(mrr,[status(thm)],[58,135]),
[iquote('0:MRR:58.1,135.1')] ).
cnf(145,plain,
( equal(the_carrier(skc6),empty_set)
| in(skc8,skc7)
| in(skc8,subset_complement(the_carrier(skc6),skc7)) ),
inference(res,[status(thm),theory(equality)],[19,134]),
[iquote('0:Res:19.0,134.0')] ).
cnf(146,plain,
equal(the_carrier(skc6),empty_set),
inference(mrr,[status(thm)],[145,143,144]),
[iquote('0:MRR:145.1,145.2,143.0,144.0')] ).
cnf(154,plain,
~ empty(empty_set),
inference(rew,[status(thm),theory(equality)],[146,141]),
[iquote('0:Rew:146.0,141.0')] ).
cnf(157,plain,
$false,
inference(mrr,[status(thm)],[154,9]),
[iquote('0:MRR:154.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU321+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.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 : Mon Jun 20 06:31:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 70 clauses, backtracked 0 clauses, performed 0 splits and kept 140 clauses.
% 0.19/0.45 SPASS allocated 97751 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 2, length 20 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : l40_tops_1 fc6_membered fc1_struct_0 t54_subset_1 t50_subset_1
% 0.19/0.45
%------------------------------------------------------------------------------