TSTP Solution File: SEU355+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU355+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:33 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 6 unt; 6 nHn; 17 RR)
% Number of literals : 34 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
rel_str(skc7),
file('SEU355+1.p',unknown),
[] ).
cnf(4,axiom,
empty(empty_set),
file('SEU355+1.p',unknown),
[] ).
cnf(9,axiom,
element(skc8,the_carrier(skc7)),
file('SEU355+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ empty(u)
| ~ in(v,u) ),
file('SEU355+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ relstr_element_smaller(skc7,empty_set,skc8)
| ~ relstr_set_smaller(skc7,empty_set,skc8) ),
file('SEU355+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ rel_str(u)
| ~ element(v,the_carrier(u))
| in(skf3(v,w,u),w)
| relstr_element_smaller(u,w,v) ),
file('SEU355+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ rel_str(u)
| ~ element(v,the_carrier(u))
| in(skf4(v,w,u),w)
| relstr_set_smaller(u,w,v) ),
file('SEU355+1.p',unknown),
[] ).
cnf(39,plain,
( ~ rel_str(skc7)
| in(skf3(skc8,u,skc7),u)
| relstr_element_smaller(skc7,u,skc8) ),
inference(res,[status(thm),theory(equality)],[9,22]),
[iquote('0:Res:9.0,22.1')] ).
cnf(40,plain,
( ~ rel_str(skc7)
| in(skf4(skc8,u,skc7),u)
| relstr_set_smaller(skc7,u,skc8) ),
inference(res,[status(thm),theory(equality)],[9,23]),
[iquote('0:Res:9.0,23.1')] ).
cnf(44,plain,
( in(skf3(skc8,u,skc7),u)
| relstr_element_smaller(skc7,u,skc8) ),
inference(mrr,[status(thm)],[39,1]),
[iquote('0:MRR:39.0,1.0')] ).
cnf(45,plain,
( in(skf4(skc8,u,skc7),u)
| relstr_set_smaller(skc7,u,skc8) ),
inference(mrr,[status(thm)],[40,1]),
[iquote('0:MRR:40.0,1.0')] ).
cnf(89,plain,
( ~ empty(u)
| relstr_set_smaller(skc7,u,skc8) ),
inference(res,[status(thm),theory(equality)],[45,17]),
[iquote('0:Res:45.0,17.1')] ).
cnf(91,plain,
( ~ empty(empty_set)
| ~ relstr_element_smaller(skc7,empty_set,skc8) ),
inference(res,[status(thm),theory(equality)],[89,21]),
[iquote('0:Res:89.1,21.1')] ).
cnf(92,plain,
~ relstr_element_smaller(skc7,empty_set,skc8),
inference(ssi,[status(thm)],[91,4]),
[iquote('0:SSi:91.0,4.0')] ).
cnf(95,plain,
( ~ empty(u)
| relstr_element_smaller(skc7,u,skc8) ),
inference(res,[status(thm),theory(equality)],[44,17]),
[iquote('0:Res:44.0,17.1')] ).
cnf(97,plain,
~ empty(empty_set),
inference(res,[status(thm),theory(equality)],[95,92]),
[iquote('0:Res:95.1,92.0')] ).
cnf(98,plain,
$false,
inference(ssi,[status(thm)],[97,4]),
[iquote('0:SSi:97.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU355+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 10:55:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 50 clauses, backtracked 0 clauses, performed 0 splits and kept 59 clauses.
% 0.18/0.44 SPASS allocated 103944 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.44 0:00:00.04 for the input.
% 0.18/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.00 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 4, length 17 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : t6_yellow_0 fc1_xboole_0 t7_boole d8_lattice3 existence_m1_subset_1 d9_lattice3
% 0.18/0.44
%------------------------------------------------------------------------------