TSTP Solution File: SEU123+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:06 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
subset(skc3,empty_set),
file('SEU123+1.p',unknown),
[] ).
cnf(6,axiom,
subset(empty_set,u),
file('SEU123+1.p',unknown),
[] ).
cnf(7,axiom,
~ equal(skc3,empty_set),
file('SEU123+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ subset(u,v)
| ~ subset(v,u)
| equal(v,u) ),
file('SEU123+1.p',unknown),
[] ).
cnf(15,plain,
( ~ subset(empty_set,skc3)
| equal(skc3,empty_set) ),
inference(res,[status(thm),theory(equality)],[3,14]),
[iquote('0:Res:3.0,14.1')] ).
cnf(22,plain,
$false,
inference(mrr,[status(thm)],[15,6,7]),
[iquote('0:MRR:15.0,15.1,6.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SEU123+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.08 % Command : run_spass %d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Mon Jun 20 05:36:18 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.12/0.34
% 0.12/0.34 SPASS V 3.9
% 0.12/0.34 SPASS beiseite: Proof found.
% 0.12/0.34 % SZS status Theorem
% 0.12/0.34 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 15 clauses.
% 0.12/0.34 SPASS allocated 97611 KBytes.
% 0.12/0.34 SPASS spent 0:00:00.06 on the problem.
% 0.12/0.34 0:00:00.03 for the input.
% 0.12/0.34 0:00:00.02 for the FLOTTER CNF translation.
% 0.12/0.34 0:00:00.00 for inferences.
% 0.12/0.34 0:00:00.00 for the backtracking.
% 0.12/0.34 0:00:00.00 for the reduction.
% 0.12/0.34
% 0.12/0.34
% 0.12/0.34 Here is a proof with depth 1, length 6 :
% 0.12/0.34 % SZS output start Refutation
% See solution above
% 0.12/0.34 Formulae used in the proof : t3_xboole_1 t2_xboole_1 d10_xboole_0
% 0.12/0.34
%------------------------------------------------------------------------------