TSTP Solution File: SEU186+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:48 EDT 2022
% Result : Theorem 0.17s 0.42s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 2 nHn; 14 RR)
% Number of literals : 22 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 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,
relation(skc5),
file('SEU186+1.p',unknown),
[] ).
cnf(11,axiom,
~ equal(skc5,empty_set),
file('SEU186+1.p',unknown),
[] ).
cnf(12,axiom,
element(skf9(u),u),
file('SEU186+1.p',unknown),
[] ).
cnf(17,axiom,
~ in(ordered_pair(u,v),skc5),
file('SEU186+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ empty(u)
| equal(u,empty_set) ),
file('SEU186+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU186+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ relation(u)
| ~ in(v,u)
| equal(ordered_pair(skf5(v),skf4(v)),v) ),
file('SEU186+1.p',unknown),
[] ).
cnf(30,plain,
( ~ in(u,skc5)
| equal(ordered_pair(skf5(u),skf4(u)),u) ),
inference(res,[status(thm),theory(equality)],[1,28]),
[iquote('0:Res:1.0,28.0')] ).
cnf(31,plain,
~ empty(skc5),
inference(res,[status(thm),theory(equality)],[19,11]),
[iquote('0:Res:19.1,11.0')] ).
cnf(54,plain,
( empty(u)
| in(skf9(u),u) ),
inference(res,[status(thm),theory(equality)],[12,25]),
[iquote('0:Res:12.0,25.0')] ).
cnf(78,plain,
( ~ in(u,skc5)
| ~ in(u,skc5) ),
inference(spl,[status(thm),theory(equality)],[30,17]),
[iquote('0:SpL:30.1,17.0')] ).
cnf(81,plain,
~ in(u,skc5),
inference(obv,[status(thm),theory(equality)],[78]),
[iquote('0:Obv:78.0')] ).
cnf(83,plain,
empty(skc5),
inference(res,[status(thm),theory(equality)],[54,81]),
[iquote('0:Res:54.1,81.0')] ).
cnf(84,plain,
$false,
inference(mrr,[status(thm)],[83,31]),
[iquote('0:MRR:83.0,31.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.11 % Command : run_spass %d %s
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sun Jun 19 15:32:24 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.42
% 0.17/0.42 SPASS V 3.9
% 0.17/0.42 SPASS beiseite: Proof found.
% 0.17/0.42 % SZS status Theorem
% 0.17/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.42 SPASS derived 49 clauses, backtracked 0 clauses, performed 0 splits and kept 44 clauses.
% 0.17/0.42 SPASS allocated 97688 KBytes.
% 0.17/0.42 SPASS spent 0:00:00.09 on the problem.
% 0.17/0.42 0:00:00.03 for the input.
% 0.17/0.42 0:00:00.03 for the FLOTTER CNF translation.
% 0.17/0.42 0:00:00.00 for inferences.
% 0.17/0.42 0:00:00.00 for the backtracking.
% 0.17/0.42 0:00:00.00 for the reduction.
% 0.17/0.42
% 0.17/0.42
% 0.17/0.42 Here is a proof with depth 3, length 14 :
% 0.17/0.42 % SZS output start Refutation
% See solution above
% 0.17/0.42 Formulae used in the proof : t56_relat_1 existence_m1_subset_1 t6_boole t2_subset d1_relat_1
% 0.17/0.42
%------------------------------------------------------------------------------