TSTP Solution File: SEU139+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:15 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 5 unt; 2 nHn; 9 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 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(1,axiom,
subset(skc2,skc3),
file('SEU139+1.p',unknown),
[] ).
cnf(2,axiom,
proper_subset(skc3,skc2),
file('SEU139+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ proper_subset(u,v)
| ~ proper_subset(v,u) ),
file('SEU139+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ proper_subset(u,v)
| ~ equal(u,v) ),
file('SEU139+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ subset(u,v)
| proper_subset(u,v)
| equal(u,v) ),
file('SEU139+1.p',unknown),
[] ).
cnf(12,plain,
~ proper_subset(skc2,skc3),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.0')] ).
cnf(13,plain,
~ equal(skc3,skc2),
inference(res,[status(thm),theory(equality)],[2,9]),
[iquote('0:Res:2.0,9.1')] ).
cnf(17,plain,
( equal(skc3,skc2)
| proper_subset(skc2,skc3) ),
inference(res,[status(thm),theory(equality)],[1,10]),
[iquote('0:Res:1.0,10.0')] ).
cnf(19,plain,
$false,
inference(mrr,[status(thm)],[17,13,12]),
[iquote('0:MRR:17.0,17.1,13.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU139+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n006.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 : Sun Jun 19 13:39:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.43
% 0.20/0.43 SPASS V 3.9
% 0.20/0.43 SPASS beiseite: Proof found.
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.20/0.43 SPASS allocated 85084 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.43 0:00:00.03 for the input.
% 0.20/0.43 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.43 0:00:00.00 for inferences.
% 0.20/0.43 0:00:00.00 for the backtracking.
% 0.20/0.43 0:00:00.00 for the reduction.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Here is a proof with depth 1, length 9 :
% 0.20/0.43 % SZS output start Refutation
% See solution above
% 0.20/0.43 Formulae used in the proof : t60_xboole_1 antisymmetry_r2_xboole_0 d8_xboole_0
% 0.20/0.43
%------------------------------------------------------------------------------