TSTP Solution File: SYN083+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:28 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 4 RR)
% Number of literals : 4 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(f(f(u,v),w),f(u,f(v,w))),
file('SYN083+1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(f(f(f(skc7,skc6),skc5),skc4),f(skc7,f(skc6,f(skc5,skc4)))),
file('SYN083+1.p',unknown),
[] ).
cnf(3,plain,
~ equal(f(skc7,f(skc6,f(skc5,skc4))),f(skc7,f(skc6,f(skc5,skc4)))),
inference(rew,[status(thm),theory(equality)],[1,2]),
[iquote('0:Rew:1.0,2.0,1.0,2.0,1.0,2.0')] ).
cnf(4,plain,
$false,
inference(obv,[status(thm),theory(equality)],[3]),
[iquote('0:Obv:3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN083+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 08:48:00 EDT 2022
% 0.14/0.34 % 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 0 clauses, backtracked 0 clauses, performed 0 splits and kept 2 clauses.
% 0.20/0.44 SPASS allocated 85057 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.03 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 0, length 4 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : p61_1 pel61
% 0.20/0.44
%------------------------------------------------------------------------------