TSTP Solution File: SEU151+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:23 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 7 unt; 3 nHn; 16 RR)
% Number of literals : 31 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ equal(skc6,skc4),
file('SEU151+1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(skc5,skc4),
file('SEU151+1.p',unknown),
[] ).
cnf(3,axiom,
equal(unordered_pair(skc6,skc5),unordered_pair(skc4,skc7)),
file('SEU151+1.p',unknown),
[] ).
cnf(4,axiom,
equal(unordered_pair(u,v),unordered_pair(v,u)),
file('SEU151+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ equal(u,v)
| ~ equal(w,unordered_pair(x,v))
| in(u,w) ),
file('SEU151+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ in(u,v)
| ~ equal(v,unordered_pair(w,x))
| equal(u,x)
| equal(u,w) ),
file('SEU151+1.p',unknown),
[] ).
cnf(12,plain,
equal(unordered_pair(skc5,skc6),unordered_pair(skc4,skc7)),
inference(rew,[status(thm),theory(equality)],[4,3]),
[iquote('0:Rew:4.0,3.0')] ).
cnf(28,plain,
( ~ in(u,unordered_pair(skc4,skc7))
| equal(u,skc6)
| equal(u,skc5) ),
inference(res,[status(thm),theory(equality)],[12,10]),
[iquote('0:Res:12.0,10.1')] ).
cnf(43,plain,
( ~ equal(u,v)
| in(u,unordered_pair(w,v)) ),
inference(eqr,[status(thm),theory(equality)],[7]),
[iquote('0:EqR:7.1')] ).
cnf(48,plain,
( ~ equal(u,v)
| in(u,unordered_pair(v,w)) ),
inference(spr,[status(thm),theory(equality)],[4,43]),
[iquote('0:SpR:4.0,43.1')] ).
cnf(90,plain,
( ~ equal(u,skc4)
| equal(u,skc6)
| equal(u,skc5) ),
inference(res,[status(thm),theory(equality)],[48,28]),
[iquote('0:Res:48.1,28.0')] ).
cnf(156,plain,
( ~ equal(u,skc4)
| ~ equal(u,skc4)
| equal(u,skc5) ),
inference(spl,[status(thm),theory(equality)],[90,1]),
[iquote('0:SpL:90.1,1.0')] ).
cnf(161,plain,
( ~ equal(u,skc4)
| equal(u,skc5) ),
inference(obv,[status(thm),theory(equality)],[156]),
[iquote('0:Obv:156.0')] ).
cnf(193,plain,
( ~ equal(u,skc4)
| ~ equal(u,skc4) ),
inference(spl,[status(thm),theory(equality)],[161,2]),
[iquote('0:SpL:161.1,2.0')] ).
cnf(196,plain,
~ equal(u,skc4),
inference(obv,[status(thm),theory(equality)],[193]),
[iquote('0:Obv:193.0')] ).
cnf(197,plain,
$false,
inference(aed,[status(thm),theory(equality)],[1,196]),
[iquote('0:AED:1.0,196.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n021.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:27:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46
% 0.19/0.46 SPASS V 3.9
% 0.19/0.46 SPASS beiseite: Proof found.
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 SPASS derived 165 clauses, backtracked 0 clauses, performed 1 splits and kept 82 clauses.
% 0.19/0.46 SPASS allocated 85250 KBytes.
% 0.19/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.19/0.46 0:00:00.04 for the input.
% 0.19/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.46 0:00:00.00 for inferences.
% 0.19/0.46 0:00:00.00 for the backtracking.
% 0.19/0.46 0:00:00.01 for the reduction.
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Here is a proof with depth 5, length 16 :
% 0.19/0.46 % SZS output start Refutation
% See solution above
% 0.19/0.46 Formulae used in the proof : t10_zfmisc_1 commutativity_k2_tarski d2_tarski antisymmetry_r2_hidden
% 0.19/0.46
%------------------------------------------------------------------------------