TSTP Solution File: SEU097+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU097+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:33:56 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 21 RR)
% Number of literals : 32 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
finite(skc24),
file('SEU097+1.p',unknown),
[] ).
cnf(2,axiom,
finite(skc23),
file('SEU097+1.p',unknown),
[] ).
cnf(96,axiom,
subset(u,u),
file('SEU097+1.p',unknown),
[] ).
cnf(99,axiom,
~ finite(symmetric_difference(skc24,skc23)),
file('SEU097+1.p',unknown),
[] ).
cnf(122,axiom,
equal(symmetric_difference(u,v),symmetric_difference(v,u)),
file('SEU097+1.p',unknown),
[] ).
cnf(126,axiom,
( ~ finite(u)
| finite(set_difference(u,v)) ),
file('SEU097+1.p',unknown),
[] ).
cnf(135,axiom,
( ~ subset(u,v)
| element(u,powerset(v)) ),
file('SEU097+1.p',unknown),
[] ).
cnf(144,axiom,
( ~ finite(u)
| ~ element(v,powerset(u))
| finite(v) ),
file('SEU097+1.p',unknown),
[] ).
cnf(148,axiom,
( ~ finite(u)
| ~ finite(v)
| finite(set_union2(v,u)) ),
file('SEU097+1.p',unknown),
[] ).
cnf(150,axiom,
equal(set_union2(set_difference(u,v),set_difference(v,u)),symmetric_difference(u,v)),
file('SEU097+1.p',unknown),
[] ).
cnf(153,plain,
~ finite(symmetric_difference(skc23,skc24)),
inference(rew,[status(thm),theory(equality)],[122,99]),
[iquote('0:Rew:122.0,99.0')] ).
cnf(158,plain,
finite(set_difference(skc23,u)),
inference(res,[status(thm),theory(equality)],[2,126]),
[iquote('0:Res:2.0,126.0')] ).
cnf(162,plain,
finite(set_difference(skc24,u)),
inference(res,[status(thm),theory(equality)],[1,126]),
[iquote('0:Res:1.0,126.0')] ).
cnf(165,plain,
( ~ finite(u)
| ~ element(symmetric_difference(skc23,skc24),powerset(u)) ),
inference(res,[status(thm),theory(equality)],[144,153]),
[iquote('0:Res:144.2,153.0')] ).
cnf(438,plain,
( ~ finite(set_difference(u,v))
| ~ finite(set_difference(v,u))
| finite(symmetric_difference(v,u)) ),
inference(spr,[status(thm),theory(equality)],[150,148]),
[iquote('0:SpR:150.0,148.2')] ).
cnf(789,plain,
( ~ finite(u)
| ~ subset(symmetric_difference(skc23,skc24),u) ),
inference(res,[status(thm),theory(equality)],[135,165]),
[iquote('0:Res:135.1,165.1')] ).
cnf(793,plain,
~ finite(symmetric_difference(skc23,skc24)),
inference(res,[status(thm),theory(equality)],[96,789]),
[iquote('0:Res:96.0,789.1')] ).
cnf(1009,plain,
( ~ finite(set_difference(u,skc23))
| finite(symmetric_difference(u,skc23)) ),
inference(sor,[status(thm)],[438,158]),
[iquote('0:SoR:438.0,158.0')] ).
cnf(1014,plain,
finite(symmetric_difference(skc24,skc23)),
inference(sor,[status(thm)],[1009,162]),
[iquote('0:SoR:1009.0,162.0')] ).
cnf(1015,plain,
finite(symmetric_difference(skc23,skc24)),
inference(rew,[status(thm),theory(equality)],[122,1014]),
[iquote('0:Rew:122.0,1014.0')] ).
cnf(1016,plain,
$false,
inference(mrr,[status(thm)],[1015,793]),
[iquote('0:MRR:1015.0,793.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU097+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Sat Jun 18 23:23:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.51
% 0.19/0.51 SPASS V 3.9
% 0.19/0.51 SPASS beiseite: Proof found.
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 SPASS derived 763 clauses, backtracked 0 clauses, performed 0 splits and kept 462 clauses.
% 0.19/0.51 SPASS allocated 98306 KBytes.
% 0.19/0.51 SPASS spent 0:00:00.16 on the problem.
% 0.19/0.51 0:00:00.04 for the input.
% 0.19/0.51 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.51 0:00:00.01 for inferences.
% 0.19/0.51 0:00:00.00 for the backtracking.
% 0.19/0.51 0:00:00.04 for the reduction.
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Here is a proof with depth 3, length 21 :
% 0.19/0.51 % SZS output start Refutation
% See solution above
% 0.19/0.51 Formulae used in the proof : t28_finset_1 reflexivity_r1_tarski commutativity_k5_xboole_0 t16_finset_1 t3_subset cc2_finset_1 l3_finset_1 d6_xboole_0
% 0.19/0.51
%------------------------------------------------------------------------------