TSTP Solution File: SEU151+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU151+2 : 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:24 EDT 2022
% Result : Theorem 0.13s 0.49s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 10 unt; 4 nHn; 22 RR)
% Number of literals : 40 ( 0 equ; 19 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(6,axiom,
~ equal(skc8,skc6),
file('SEU151+2.p',unknown),
[] ).
cnf(7,axiom,
~ equal(skc7,skc6),
file('SEU151+2.p',unknown),
[] ).
cnf(22,axiom,
equal(unordered_pair(skc8,skc7),unordered_pair(skc6,skc9)),
file('SEU151+2.p',unknown),
[] ).
cnf(23,axiom,
equal(unordered_pair(u,v),unordered_pair(v,u)),
file('SEU151+2.p',unknown),
[] ).
cnf(81,axiom,
( ~ equal(u,v)
| ~ equal(w,unordered_pair(v,x))
| in(u,w) ),
file('SEU151+2.p',unknown),
[] ).
cnf(98,axiom,
( ~ in(u,v)
| ~ equal(v,unordered_pair(w,x))
| equal(u,x)
| equal(u,w) ),
file('SEU151+2.p',unknown),
[] ).
cnf(114,plain,
equal(unordered_pair(skc7,skc8),unordered_pair(skc6,skc9)),
inference(rew,[status(thm),theory(equality)],[23,22]),
[iquote('0:Rew:23.0,22.0')] ).
cnf(166,plain,
( ~ in(u,unordered_pair(skc7,skc8))
| equal(u,skc6)
| equal(u,skc9) ),
inference(res,[status(thm),theory(equality)],[114,98]),
[iquote('0:Res:114.0,98.1')] ).
cnf(168,plain,
( ~ equal(u,skc6)
| in(u,unordered_pair(skc7,skc8)) ),
inference(res,[status(thm),theory(equality)],[114,81]),
[iquote('0:Res:114.0,81.1')] ).
cnf(174,plain,
( ~ in(u,unordered_pair(skc6,skc9))
| equal(u,skc8)
| equal(u,skc7) ),
inference(res,[status(thm),theory(equality)],[114,98]),
[iquote('0:Res:114.0,98.1')] ).
cnf(176,plain,
( ~ equal(u,skc7)
| in(u,unordered_pair(skc6,skc9)) ),
inference(res,[status(thm),theory(equality)],[114,81]),
[iquote('0:Res:114.0,81.1')] ).
cnf(182,plain,
( ~ equal(u,skc6)
| in(u,unordered_pair(skc6,skc9)) ),
inference(rew,[status(thm),theory(equality)],[114,168]),
[iquote('0:Rew:114.0,168.1')] ).
cnf(184,plain,
( ~ in(u,unordered_pair(skc6,skc9))
| equal(u,skc9)
| equal(u,skc6) ),
inference(rew,[status(thm),theory(equality)],[114,166]),
[iquote('0:Rew:114.0,166.0')] ).
cnf(193,plain,
( ~ in(skc6,unordered_pair(skc6,skc9))
| equal(skc7,skc6) ),
inference(res,[status(thm),theory(equality)],[174,6]),
[iquote('0:Res:174.2,6.0')] ).
cnf(196,plain,
( ~ in(skc7,unordered_pair(skc6,skc9))
| equal(skc9,skc7) ),
inference(res,[status(thm),theory(equality)],[184,7]),
[iquote('0:Res:184.1,7.0')] ).
cnf(202,plain,
~ in(skc6,unordered_pair(skc6,skc9)),
inference(mrr,[status(thm)],[193,7]),
[iquote('0:MRR:193.1,7.0')] ).
cnf(374,plain,
( ~ equal(skc7,skc7)
| equal(skc9,skc7) ),
inference(res,[status(thm),theory(equality)],[176,196]),
[iquote('0:Res:176.1,196.0')] ).
cnf(378,plain,
equal(skc9,skc7),
inference(obv,[status(thm),theory(equality)],[374]),
[iquote('0:Obv:374.0')] ).
cnf(379,plain,
~ in(skc6,unordered_pair(skc6,skc7)),
inference(rew,[status(thm),theory(equality)],[378,202]),
[iquote('0:Rew:378.0,202.0')] ).
cnf(387,plain,
( ~ equal(u,skc6)
| in(u,unordered_pair(skc6,skc7)) ),
inference(rew,[status(thm),theory(equality)],[378,182]),
[iquote('0:Rew:378.0,182.1')] ).
cnf(452,plain,
~ equal(skc6,skc6),
inference(res,[status(thm),theory(equality)],[387,379]),
[iquote('0:Res:387.1,379.0')] ).
cnf(454,plain,
$false,
inference(obv,[status(thm),theory(equality)],[452]),
[iquote('0:Obv:452.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SEU151+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.09 % Command : run_spass %d %s
% 0.09/0.28 % Computer : n027.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sun Jun 19 14:54:24 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.13/0.49
% 0.13/0.49 SPASS V 3.9
% 0.13/0.49 SPASS beiseite: Proof found.
% 0.13/0.49 % SZS status Theorem
% 0.13/0.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.49 SPASS derived 289 clauses, backtracked 0 clauses, performed 0 splits and kept 224 clauses.
% 0.13/0.49 SPASS allocated 99255 KBytes.
% 0.13/0.49 SPASS spent 0:00:00.20 on the problem.
% 0.13/0.49 0:00:00.03 for the input.
% 0.13/0.49 0:00:00.12 for the FLOTTER CNF translation.
% 0.13/0.49 0:00:00.00 for inferences.
% 0.13/0.49 0:00:00.00 for the backtracking.
% 0.13/0.49 0:00:00.02 for the reduction.
% 0.13/0.49
% 0.13/0.49
% 0.13/0.49 Here is a proof with depth 3, length 22 :
% 0.13/0.49 % SZS output start Refutation
% See solution above
% 0.13/0.50 Formulae used in the proof : t10_zfmisc_1 commutativity_k2_tarski d2_tarski
% 0.13/0.50
%------------------------------------------------------------------------------