%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU321+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 136.14s 136.35s
% Output : Refutation 136.14s
% 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(skc32),
file('SEU321+2.p',unknown),
[] ).
cnf(24,axiom,
empty(empty_set),
file('SEU321+2.p',unknown),
[] ).
cnf(84,axiom,
~ empty_carrier(skc32),
file('SEU321+2.p',unknown),
[] ).
cnf(132,axiom,
element(skc34,the_carrier(skc32)),
file('SEU321+2.p',unknown),
[] ).
cnf(156,axiom,
element(skc33,powerset(the_carrier(skc32))),
file('SEU321+2.p',unknown),
[] ).
cnf(479,axiom,
( ~ one_sorted_str(u)
| ~ empty(the_carrier(u))
| empty_carrier(u) ),
file('SEU321+2.p',unknown),
[] ).
cnf(528,axiom,
( ~ in(skc34,skc33)
| in(skc34,subset_complement(the_carrier(skc32),skc33)) ),
file('SEU321+2.p',unknown),
[] ).
cnf(529,axiom,
( ~ in(skc34,subset_complement(the_carrier(skc32),skc33))
| in(skc34,skc33) ),
file('SEU321+2.p',unknown),
[] ).
cnf(865,axiom,
( ~ in(u,v)
| ~ element(v,powerset(w))
| ~ in(u,subset_complement(w,v)) ),
file('SEU321+2.p',unknown),
[] ).
cnf(1000,axiom,
( ~ element(u,v)
| ~ element(w,powerset(v))
| in(u,w)
| equal(v,empty_set)
| in(u,subset_complement(v,w)) ),
file('SEU321+2.p',unknown),
[] ).
cnf(1445,plain,
( ~ empty(the_carrier(skc32))
| empty_carrier(skc32) ),
inference(res,[status(thm),theory(equality)],[1,479]),
[iquote('0:Res:1.0,479.0')] ).
cnf(1626,plain,
( ~ element(u,the_carrier(skc32))
| equal(the_carrier(skc32),empty_set)
| in(u,skc33)
| in(u,subset_complement(the_carrier(skc32),skc33)) ),
inference(res,[status(thm),theory(equality)],[156,1000]),
[iquote('0:Res:156.0,1000.0')] ).
cnf(1631,plain,
( ~ in(u,subset_complement(the_carrier(skc32),skc33))
| ~ in(u,skc33) ),
inference(res,[status(thm),theory(equality)],[156,865]),
[iquote('0:Res:156.0,865.0')] ).
cnf(1644,plain,
~ empty(the_carrier(skc32)),
inference(mrr,[status(thm)],[1445,84]),
[iquote('0:MRR:1445.1,84.0')] ).
cnf(1649,plain,
~ in(skc34,skc33),
inference(mrr,[status(thm)],[528,1631]),
[iquote('0:MRR:528.1,1631.0')] ).
cnf(1650,plain,
~ in(skc34,subset_complement(the_carrier(skc32),skc33)),
inference(mrr,[status(thm)],[529,1631]),
[iquote('0:MRR:529.1,1631.1')] ).
cnf(1737,plain,
( equal(the_carrier(skc32),empty_set)
| in(skc34,skc33)
| in(skc34,subset_complement(the_carrier(skc32),skc33)) ),
inference(res,[status(thm),theory(equality)],[132,1626]),
[iquote('0:Res:132.0,1626.0')] ).
cnf(1787,plain,
equal(the_carrier(skc32),empty_set),
inference(mrr,[status(thm)],[1737,1649,1650]),
[iquote('0:MRR:1737.1,1737.2,1649.0,1650.0')] ).
cnf(1851,plain,
~ empty(empty_set),
inference(rew,[status(thm),theory(equality)],[1787,1644]),
[iquote('0:Rew:1787.0,1644.0')] ).
cnf(1912,plain,
$false,
inference(mrr,[status(thm)],[1851,24]),
[iquote('0:MRR:1851.0,24.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU321+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 20 07:21:56 EDT 2022
% 0.14/0.35 % CPUTime :
% 136.14/136.35
% 136.14/136.35 SPASS V 3.9
% 136.14/136.35 SPASS beiseite: Proof found.
% 136.14/136.35 % SZS status Theorem
% 136.14/136.35 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 136.14/136.35 SPASS derived 430 clauses, backtracked 0 clauses, performed 0 splits and kept 1413 clauses.
% 136.14/136.35 SPASS allocated 165187 KBytes.
% 136.14/136.35 SPASS spent 0:2:15.94 on the problem.
% 136.14/136.35 0:00:00.04 for the input.
% 136.14/136.35 0:2:15.18 for the FLOTTER CNF translation.
% 136.14/136.35 0:00:00.00 for inferences.
% 136.14/136.35 0:00:00.00 for the backtracking.
% 136.14/136.35 0:00:00.39 for the reduction.
% 136.14/136.35
% 136.14/136.35
% 136.14/136.35 Here is a proof with depth 2, length 20 :
% 136.14/136.35 % SZS output start Refutation
% See solution above
% 136.14/136.35 Formulae used in the proof : l40_tops_1 fc6_membered fc1_struct_0 t54_subset_1 t50_subset_1
% 136.14/136.35
%------------------------------------------------------------------------------