TSTP Solution File: RNG103+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG103+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 20:41:29 EDT 2022
% Result : Theorem 0.71s 0.89s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 22 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aElement0(xc),
file('RNG103+1.p',unknown),
[] ).
cnf(5,axiom,
aElement0(xu),
file('RNG103+1.p',unknown),
[] ).
cnf(6,axiom,
aElement0(xv),
file('RNG103+1.p',unknown),
[] ).
cnf(17,axiom,
equal(sdtasdt0(xc,xu),xx),
file('RNG103+1.p',unknown),
[] ).
cnf(18,axiom,
equal(sdtasdt0(xc,xv),xy),
file('RNG103+1.p',unknown),
[] ).
cnf(35,axiom,
~ equal(sdtasdt0(xc,sdtpldt0(xu,xv)),sdtpldt0(xx,xy)),
file('RNG103+1.p',unknown),
[] ).
cnf(81,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| equal(sdtasdt0(w,sdtpldt0(v,u)),sdtpldt0(sdtasdt0(w,v),sdtasdt0(w,u))) ),
file('RNG103+1.p',unknown),
[] ).
cnf(2226,plain,
( ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(xc)
| ~ equal(sdtpldt0(sdtasdt0(xc,xu),sdtasdt0(xc,xv)),sdtpldt0(xx,xy)) ),
inference(spl,[status(thm),theory(equality)],[81,35]),
[iquote('0:SpL:81.3,35.0')] ).
cnf(2230,plain,
( ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(xc)
| ~ equal(sdtpldt0(xx,xy),sdtpldt0(xx,xy)) ),
inference(rew,[status(thm),theory(equality)],[17,2226,18]),
[iquote('0:Rew:17.0,2226.3,18.0,2226.3')] ).
cnf(2231,plain,
( ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(xc) ),
inference(obv,[status(thm),theory(equality)],[2230]),
[iquote('0:Obv:2230.3')] ).
cnf(2232,plain,
$false,
inference(ssi,[status(thm)],[2231,3,5,6]),
[iquote('0:SSi:2231.2,2231.1,2231.0,3.0,5.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG103+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 18:40:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/0.89
% 0.71/0.89 SPASS V 3.9
% 0.71/0.89 SPASS beiseite: Proof found.
% 0.71/0.89 % SZS status Theorem
% 0.71/0.89 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.71/0.89 SPASS derived 1472 clauses, backtracked 65 clauses, performed 3 splits and kept 710 clauses.
% 0.71/0.89 SPASS allocated 99966 KBytes.
% 0.71/0.89 SPASS spent 0:00:00.52 on the problem.
% 0.71/0.89 0:00:00.04 for the input.
% 0.71/0.89 0:00:00.12 for the FLOTTER CNF translation.
% 0.71/0.89 0:00:00.02 for inferences.
% 0.71/0.89 0:00:00.00 for the backtracking.
% 0.71/0.89 0:00:00.31 for the reduction.
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Here is a proof with depth 1, length 11 :
% 0.71/0.89 % SZS output start Refutation
% See solution above
% 0.71/0.89 Formulae used in the proof : m__1905 m__1956 m__1979 m__ mAMDistr
% 0.71/0.89
%------------------------------------------------------------------------------