TSTP Solution File: SEU267+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU267+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:35:41 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 4 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,axiom,
( ~ equal(pair_second(ordered_pair(skc8,skc9)),skc9)
| ~ equal(pair_first(ordered_pair(skc6,skc7)),skc6) ),
file('SEU267+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ equal(u,pair_first(v))
| ~ equal(v,ordered_pair(w,x))
| equal(u,w) ),
file('SEU267+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ equal(u,pair_second(v))
| ~ equal(v,ordered_pair(w,x))
| equal(u,x) ),
file('SEU267+1.p',unknown),
[] ).
cnf(29,plain,
( ~ equal(u,pair_second(ordered_pair(v,w)))
| equal(u,w) ),
inference(eqr,[status(thm),theory(equality)],[14]),
[iquote('0:EqR:14.1')] ).
cnf(30,plain,
equal(pair_second(ordered_pair(u,v)),v),
inference(eqr,[status(thm),theory(equality)],[29]),
[iquote('0:EqR:29.0')] ).
cnf(32,plain,
( ~ equal(skc9,skc9)
| ~ equal(pair_first(ordered_pair(skc6,skc7)),skc6) ),
inference(rew,[status(thm),theory(equality)],[30,12]),
[iquote('0:Rew:30.0,12.0')] ).
cnf(33,plain,
~ equal(pair_first(ordered_pair(skc6,skc7)),skc6),
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.0')] ).
cnf(35,plain,
( ~ equal(u,pair_first(ordered_pair(v,w)))
| equal(u,v) ),
inference(eqr,[status(thm),theory(equality)],[13]),
[iquote('0:EqR:13.1')] ).
cnf(36,plain,
equal(pair_first(ordered_pair(u,v)),u),
inference(eqr,[status(thm),theory(equality)],[35]),
[iquote('0:EqR:35.0')] ).
cnf(37,plain,
$false,
inference(unc,[status(thm)],[36,33]),
[iquote('0:UnC:36.0,33.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU267+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jun 19 10:06:32 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.45
% 0.21/0.45 SPASS V 3.9
% 0.21/0.45 SPASS beiseite: Proof found.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.45 SPASS derived 17 clauses, backtracked 0 clauses, performed 0 splits and kept 27 clauses.
% 0.21/0.45 SPASS allocated 97784 KBytes.
% 0.21/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.21/0.45 0:00:00.04 for the input.
% 0.21/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.45 0:00:00.00 for inferences.
% 0.21/0.45 0:00:00.00 for the backtracking.
% 0.21/0.45 0:00:00.00 for the reduction.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Here is a proof with depth 2, length 10 :
% 0.21/0.45 % SZS output start Refutation
% See solution above
% 0.21/0.45 Formulae used in the proof : t7_mcart_1 d1_mcart_1 d2_mcart_1
% 0.21/0.45
%------------------------------------------------------------------------------