TSTP Solution File: RNG116+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG116+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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 : Mon Jul 18 20:41:31 EDT 2022
% Result : Theorem 1.19s 1.40s
% Output : Refutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 12 RR)
% Number of literals : 18 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(14,axiom,
aElement0(skc61),
file('RNG116+4.p',unknown),
[] ).
cnf(15,axiom,
aElement0(skc60),
file('RNG116+4.p',unknown),
[] ).
cnf(59,axiom,
equal(sdtasdt0(xa,skc60),xk),
file('RNG116+4.p',unknown),
[] ).
cnf(60,axiom,
equal(sdtasdt0(xb,skc61),xl),
file('RNG116+4.p',unknown),
[] ).
cnf(61,axiom,
equal(sdtpldt0(xk,xl),xu),
file('RNG116+4.p',unknown),
[] ).
cnf(129,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ equal(sdtpldt0(sdtasdt0(xa,v),sdtasdt0(xb,u)),xu) ),
file('RNG116+4.p',unknown),
[] ).
cnf(169,plain,
( ~ aElement0(u)
| ~ equal(sdtpldt0(sdtasdt0(xa,skc60),sdtasdt0(xb,u)),xu) ),
inference(res,[status(thm),theory(equality)],[15,129]),
[iquote('0:Res:15.0,129.0')] ).
cnf(219,plain,
( ~ aElement0(u)
| ~ equal(sdtpldt0(xk,sdtasdt0(xb,u)),xu) ),
inference(rew,[status(thm),theory(equality)],[59,169]),
[iquote('0:Rew:59.0,169.1')] ).
cnf(4980,plain,
( ~ aElement0(skc61)
| ~ equal(sdtpldt0(xk,xl),xu) ),
inference(spl,[status(thm),theory(equality)],[60,219]),
[iquote('0:SpL:60.0,219.1')] ).
cnf(4990,plain,
( ~ aElement0(skc61)
| ~ equal(xu,xu) ),
inference(rew,[status(thm),theory(equality)],[61,4980]),
[iquote('0:Rew:61.0,4980.1')] ).
cnf(4991,plain,
~ aElement0(skc61),
inference(obv,[status(thm),theory(equality)],[4990]),
[iquote('0:Obv:4990.1')] ).
cnf(4992,plain,
$false,
inference(ssi,[status(thm)],[4991,14]),
[iquote('0:SSi:4991.0,14.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG116+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 12:50:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.19/1.40
% 1.19/1.40 SPASS V 3.9
% 1.19/1.40 SPASS beiseite: Proof found.
% 1.19/1.40 % SZS status Theorem
% 1.19/1.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.19/1.40 SPASS derived 3446 clauses, backtracked 440 clauses, performed 4 splits and kept 1881 clauses.
% 1.19/1.40 SPASS allocated 101703 KBytes.
% 1.19/1.40 SPASS spent 0:00:00.99 on the problem.
% 1.19/1.40 0:00:00.04 for the input.
% 1.19/1.40 0:00:00.21 for the FLOTTER CNF translation.
% 1.19/1.40 0:00:00.04 for inferences.
% 1.19/1.40 0:00:00.01 for the backtracking.
% 1.19/1.40 0:00:00.64 for the reduction.
% 1.19/1.40
% 1.19/1.40
% 1.19/1.40 Here is a proof with depth 2, length 12 :
% 1.19/1.40 % SZS output start Refutation
% See solution above
% 1.19/1.40 Formulae used in the proof : m__2456 m__
% 1.19/1.40
%------------------------------------------------------------------------------