TSTP Solution File: SYN071+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 : Thu Jul 21 12:18:19 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 9 unt; 4 nHn; 13 RR)
% Number of literals : 17 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 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,
~ equal(d,a),
file('SYN071+1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(c,b),
file('SYN071+1.p',unknown),
[] ).
cnf(3,axiom,
( equal(d,c)
| equal(b,a) ),
file('SYN071+1.p',unknown),
[] ).
cnf(4,axiom,
( equal(d,b)
| equal(c,a) ),
file('SYN071+1.p',unknown),
[] ).
cnf(5,plain,
equal(d,b),
inference(spt,[spt(split,[position(s1)])],[4]),
[iquote('1:Spt:4.0')] ).
cnf(6,plain,
~ equal(b,a),
inference(rew,[status(thm),theory(equality)],[5,1]),
[iquote('1:Rew:5.0,1.0')] ).
cnf(7,plain,
( equal(c,b)
| equal(b,a) ),
inference(rew,[status(thm),theory(equality)],[5,3]),
[iquote('1:Rew:5.0,3.0')] ).
cnf(8,plain,
$false,
inference(mrr,[status(thm)],[7,2,6]),
[iquote('1:MRR:7.0,7.1,2.0,6.0')] ).
cnf(9,plain,
~ equal(d,b),
inference(spt,[spt(split,[position(sa)])],[8,5]),
[iquote('1:Spt:8.0,4.0,5.0')] ).
cnf(10,plain,
equal(c,a),
inference(spt,[spt(split,[position(s2)])],[4]),
[iquote('1:Spt:8.0,4.1')] ).
cnf(11,plain,
~ equal(b,a),
inference(rew,[status(thm),theory(equality)],[10,2]),
[iquote('1:Rew:10.0,2.0')] ).
cnf(12,plain,
( equal(d,a)
| equal(b,a) ),
inference(rew,[status(thm),theory(equality)],[10,3]),
[iquote('1:Rew:10.0,3.0')] ).
cnf(13,plain,
$false,
inference(mrr,[status(thm)],[12,1,11]),
[iquote('1:MRR:12.0,12.1,1.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 16:21:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 4 clauses, backtracked 4 clauses, performed 1 splits and kept 12 clauses.
% 0.20/0.44 SPASS allocated 85050 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 1, length 13 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : pel48 pel48_1 pel48_2
% 0.20/0.44
%------------------------------------------------------------------------------