%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:34:01 EDT 2022
% Result : Theorem 0.37s 0.58s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 7 unt; 5 nHn; 19 RR)
% Number of literals : 36 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,axiom,
cup_closed(finite_subsets(u)),
file('SEU113+1.p',unknown),
[] ).
cnf(13,axiom,
diff_closed(finite_subsets(u)),
file('SEU113+1.p',unknown),
[] ).
cnf(14,axiom,
preboolean(finite_subsets(u)),
file('SEU113+1.p',unknown),
[] ).
cnf(31,axiom,
~ empty(powerset(u)),
file('SEU113+1.p',unknown),
[] ).
cnf(43,axiom,
~ subset(finite_subsets(skc5),powerset(skc5)),
file('SEU113+1.p',unknown),
[] ).
cnf(53,axiom,
( subset(u,v)
| in(skf8(v,u),u) ),
file('SEU113+1.p',unknown),
[] ).
cnf(55,axiom,
( ~ subset(u,v)
| element(u,powerset(v)) ),
file('SEU113+1.p',unknown),
[] ).
cnf(56,axiom,
( ~ in(skf8(u,v),u)
| subset(w,u) ),
file('SEU113+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU113+1.p',unknown),
[] ).
cnf(64,axiom,
( ~ preboolean(u)
| ~ in(v,u)
| ~ equal(u,finite_subsets(w))
| subset(v,w) ),
file('SEU113+1.p',unknown),
[] ).
cnf(114,plain,
( ~ subset(u,v)
| empty(powerset(v))
| in(u,powerset(v)) ),
inference(res,[status(thm),theory(equality)],[55,57]),
[iquote('0:Res:55.1,57.0')] ).
cnf(119,plain,
( ~ subset(u,v)
| in(u,powerset(v)) ),
inference(mrr,[status(thm)],[114,31]),
[iquote('0:MRR:114.1,31.0')] ).
cnf(215,plain,
( ~ preboolean(finite_subsets(u))
| ~ in(v,finite_subsets(u))
| subset(v,u) ),
inference(eqr,[status(thm),theory(equality)],[64]),
[iquote('0:EqR:64.2')] ).
cnf(216,plain,
( ~ in(u,finite_subsets(v))
| subset(u,v) ),
inference(ssi,[status(thm)],[215,13,12,14]),
[iquote('0:SSi:215.0,13.0,12.0,14.0')] ).
cnf(236,plain,
( ~ subset(skf8(powerset(u),v),u)
| subset(w,powerset(u)) ),
inference(res,[status(thm),theory(equality)],[119,56]),
[iquote('0:Res:119.1,56.0')] ).
cnf(346,plain,
( subset(finite_subsets(u),v)
| subset(skf8(v,finite_subsets(u)),u) ),
inference(res,[status(thm),theory(equality)],[53,216]),
[iquote('0:Res:53.1,216.0')] ).
cnf(1752,plain,
( subset(finite_subsets(u),powerset(u))
| subset(v,powerset(u)) ),
inference(res,[status(thm),theory(equality)],[346,236]),
[iquote('0:Res:346.1,236.0')] ).
cnf(1754,plain,
subset(finite_subsets(u),powerset(u)),
inference(con,[status(thm)],[1752]),
[iquote('0:Con:1752.1')] ).
cnf(1755,plain,
$false,
inference(unc,[status(thm)],[1754,43]),
[iquote('0:UnC:1754.0,43.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU113+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n013.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 : Sun Jun 19 04:05:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.37/0.58
% 0.37/0.58 SPASS V 3.9
% 0.37/0.58 SPASS beiseite: Proof found.
% 0.37/0.58 % SZS status Theorem
% 0.37/0.58 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.58 SPASS derived 1503 clauses, backtracked 0 clauses, performed 0 splits and kept 696 clauses.
% 0.37/0.58 SPASS allocated 98745 KBytes.
% 0.37/0.58 SPASS spent 0:00:00.22 on the problem.
% 0.37/0.58 0:00:00.04 for the input.
% 0.37/0.58 0:00:00.04 for the FLOTTER CNF translation.
% 0.37/0.58 0:00:00.02 for inferences.
% 0.37/0.58 0:00:00.00 for the backtracking.
% 0.37/0.58 0:00:00.10 for the reduction.
% 0.37/0.58
% 0.37/0.58
% 0.37/0.58 Here is a proof with depth 3, length 19 :
% 0.37/0.58 % SZS output start Refutation
% See solution above
% 0.37/0.58 Formulae used in the proof : fc2_finsub_1 fc1_subset_1 t26_finsub_1 d3_tarski t3_subset t2_subset d5_finsub_1
% 0.37/0.58
%------------------------------------------------------------------------------