%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.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 : Mon Jul 18 14:25:49 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 10 unt; 1 nHn; 20 RR)
% Number of literals : 33 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
ordinal(skc15),
file('NUM388+1.p',unknown),
[] ).
cnf(33,axiom,
in(skc16,skc14),
file('NUM388+1.p',unknown),
[] ).
cnf(34,axiom,
in(skc14,skc15),
file('NUM388+1.p',unknown),
[] ).
cnf(38,axiom,
~ in(skc16,skc15),
file('NUM388+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ ordinal(u)
| epsilon_transitive(u) ),
file('NUM388+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ empty(u)
| ~ in(v,u) ),
file('NUM388+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ subset(u,v)
| element(u,powerset(v)) ),
file('NUM388+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('NUM388+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ epsilon_transitive(u)
| ~ in(v,u)
| subset(v,u) ),
file('NUM388+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ in(u,v)
| ~ element(v,powerset(w))
| element(u,w) ),
file('NUM388+1.p',unknown),
[] ).
cnf(62,plain,
epsilon_transitive(skc15),
inference(res,[status(thm),theory(equality)],[2,41]),
[iquote('0:Res:2.0,41.0')] ).
cnf(66,plain,
( ~ epsilon_transitive(skc15)
| subset(skc14,skc15) ),
inference(res,[status(thm),theory(equality)],[34,55]),
[iquote('0:Res:34.0,55.1')] ).
cnf(68,plain,
~ empty(skc15),
inference(res,[status(thm),theory(equality)],[34,48]),
[iquote('0:Res:34.0,48.1')] ).
cnf(76,plain,
( ~ element(skc14,powerset(u))
| element(skc16,u) ),
inference(res,[status(thm),theory(equality)],[33,57]),
[iquote('0:Res:33.0,57.0')] ).
cnf(80,plain,
( ~ element(skc16,skc15)
| empty(skc15) ),
inference(res,[status(thm),theory(equality)],[53,38]),
[iquote('0:Res:53.1,38.0')] ).
cnf(81,plain,
subset(skc14,skc15),
inference(mrr,[status(thm)],[66,62]),
[iquote('0:MRR:66.0,62.0')] ).
cnf(83,plain,
~ element(skc16,skc15),
inference(mrr,[status(thm)],[80,68]),
[iquote('0:MRR:80.1,68.0')] ).
cnf(107,plain,
( ~ subset(skc14,u)
| element(skc16,u) ),
inference(res,[status(thm),theory(equality)],[52,76]),
[iquote('0:Res:52.1,76.0')] ).
cnf(111,plain,
~ subset(skc14,skc15),
inference(res,[status(thm),theory(equality)],[107,83]),
[iquote('0:Res:107.1,83.0')] ).
cnf(112,plain,
$false,
inference(mrr,[status(thm)],[111,81]),
[iquote('0:MRR:111.0,81.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM388+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 10:33:59 EDT 2022
% 0.13/0.33 % 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 49 clauses, backtracked 0 clauses, performed 0 splits and kept 88 clauses.
% 0.19/0.45 SPASS allocated 97781 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 3, length 20 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : t19_ordinal1 cc1_ordinal1 t7_boole t3_subset t2_subset d2_ordinal1 t4_subset
% 0.19/0.45
%------------------------------------------------------------------------------