TSTP Solution File: SEU107+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:00 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 8 unt; 5 nHn; 19 RR)
% Number of literals : 46 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
preboolean(skc5),
file('SEU107+1.p',unknown),
[] ).
cnf(9,axiom,
~ empty(skc5),
file('SEU107+1.p',unknown),
[] ).
cnf(23,axiom,
subset(u,u),
file('SEU107+1.p',unknown),
[] ).
cnf(24,axiom,
~ in(empty_set,skc5),
file('SEU107+1.p',unknown),
[] ).
cnf(25,axiom,
element(skf6(u),u),
file('SEU107+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU107+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ subset(u,v)
| equal(set_difference(u,v),empty_set) ),
file('SEU107+1.p',unknown),
[] ).
cnf(57,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| element(prebool_difference(u,w,v),u)
| empty(u) ),
file('SEU107+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| equal(prebool_difference(u,v,w),set_difference(v,w)) ),
file('SEU107+1.p',unknown),
[] ).
cnf(59,plain,
( ~ preboolean(u)
| ~ element(v,u)
| ~ element(w,u)
| empty(u)
| element(set_difference(v,w),u) ),
inference(rew,[status(thm),theory(equality)],[58,57]),
[iquote('0:Rew:58.3,57.3')] ).
cnf(60,plain,
( ~ element(u,skc5)
| ~ element(v,skc5)
| element(set_difference(v,u),skc5)
| empty(skc5) ),
inference(res,[status(thm),theory(equality)],[1,59]),
[iquote('0:Res:1.0,59.0')] ).
cnf(72,plain,
( ~ element(empty_set,skc5)
| empty(skc5) ),
inference(res,[status(thm),theory(equality)],[50,24]),
[iquote('0:Res:50.1,24.0')] ).
cnf(73,plain,
~ element(empty_set,skc5),
inference(mrr,[status(thm)],[72,9]),
[iquote('0:MRR:72.1,9.0')] ).
cnf(74,plain,
( ~ element(u,skc5)
| ~ element(v,skc5)
| element(set_difference(u,v),skc5) ),
inference(mrr,[status(thm)],[60,9]),
[iquote('0:MRR:60.3,9.0')] ).
cnf(572,plain,
( ~ subset(u,v)
| ~ element(u,skc5)
| ~ element(v,skc5)
| element(empty_set,skc5) ),
inference(spr,[status(thm),theory(equality)],[52,74]),
[iquote('0:SpR:52.1,74.2')] ).
cnf(575,plain,
( ~ subset(u,v)
| ~ element(u,skc5)
| ~ element(v,skc5) ),
inference(mrr,[status(thm)],[572,73]),
[iquote('0:MRR:572.3,73.0')] ).
cnf(844,plain,
( ~ element(u,skc5)
| ~ element(u,skc5) ),
inference(res,[status(thm),theory(equality)],[23,575]),
[iquote('0:Res:23.0,575.0')] ).
cnf(857,plain,
~ element(u,skc5),
inference(obv,[status(thm),theory(equality)],[844]),
[iquote('0:Obv:844.0')] ).
cnf(858,plain,
$false,
inference(unc,[status(thm)],[857,25]),
[iquote('0:UnC:857.0,25.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU107+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 19:26:52 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.55
% 0.20/0.55 SPASS V 3.9
% 0.20/0.55 SPASS beiseite: Proof found.
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 SPASS derived 706 clauses, backtracked 0 clauses, performed 0 splits and kept 339 clauses.
% 0.20/0.55 SPASS allocated 98160 KBytes.
% 0.20/0.55 SPASS spent 0:00:00.18 on the problem.
% 0.20/0.55 0:00:00.04 for the input.
% 0.20/0.55 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.55 0:00:00.02 for inferences.
% 0.20/0.55 0:00:00.00 for the backtracking.
% 0.20/0.55 0:00:00.06 for the reduction.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Here is a proof with depth 3, length 19 :
% 0.20/0.55 % SZS output start Refutation
% See solution above
% 0.20/0.55 Formulae used in the proof : t18_finsub_1 reflexivity_r1_tarski existence_m1_subset_1 t2_subset t37_xboole_1 dt_k2_finsub_1 redefinition_k2_finsub_1
% 0.20/0.55
%------------------------------------------------------------------------------