TSTP Solution File: RNG103+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG103+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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 1.12s 1.29s
% Output : Refutation 1.12s
% 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+2.p',unknown),
[] ).
cnf(7,axiom,
aElement0(xu),
file('RNG103+2.p',unknown),
[] ).
cnf(8,axiom,
aElement0(xv),
file('RNG103+2.p',unknown),
[] ).
cnf(21,axiom,
equal(sdtasdt0(xc,xu),xx),
file('RNG103+2.p',unknown),
[] ).
cnf(22,axiom,
equal(sdtasdt0(xc,xv),xy),
file('RNG103+2.p',unknown),
[] ).
cnf(39,axiom,
~ equal(sdtasdt0(xc,sdtpldt0(xu,xv)),sdtpldt0(xx,xy)),
file('RNG103+2.p',unknown),
[] ).
cnf(85,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| equal(sdtasdt0(w,sdtpldt0(v,u)),sdtpldt0(sdtasdt0(w,v),sdtasdt0(w,u))) ),
file('RNG103+2.p',unknown),
[] ).
cnf(3796,plain,
( ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(xc)
| ~ equal(sdtpldt0(sdtasdt0(xc,xu),sdtasdt0(xc,xv)),sdtpldt0(xx,xy)) ),
inference(spl,[status(thm),theory(equality)],[85,39]),
[iquote('0:SpL:85.3,39.0')] ).
cnf(3797,plain,
( ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(xc)
| ~ equal(sdtpldt0(xx,xy),sdtpldt0(xx,xy)) ),
inference(rew,[status(thm),theory(equality)],[21,3796,22]),
[iquote('0:Rew:21.0,3796.3,22.0,3796.3')] ).
cnf(3798,plain,
( ~ aElement0(xv)
| ~ aElement0(xu)
| ~ aElement0(xc) ),
inference(obv,[status(thm),theory(equality)],[3797]),
[iquote('0:Obv:3797.3')] ).
cnf(3799,plain,
$false,
inference(ssi,[status(thm)],[3798,3,7,8]),
[iquote('0:SSi:3798.2,3798.1,3798.0,3.0,7.0,8.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG103+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 12:17:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.12/1.29
% 1.12/1.29 SPASS V 3.9
% 1.12/1.29 SPASS beiseite: Proof found.
% 1.12/1.29 % SZS status Theorem
% 1.12/1.29 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.12/1.29 SPASS derived 2581 clauses, backtracked 451 clauses, performed 6 splits and kept 1448 clauses.
% 1.12/1.29 SPASS allocated 100949 KBytes.
% 1.12/1.29 SPASS spent 0:00:00.91 on the problem.
% 1.12/1.29 0:00:00.04 for the input.
% 1.12/1.29 0:00:00.13 for the FLOTTER CNF translation.
% 1.12/1.29 0:00:00.03 for inferences.
% 1.12/1.29 0:00:00.01 for the backtracking.
% 1.12/1.29 0:00:00.66 for the reduction.
% 1.12/1.29
% 1.12/1.29
% 1.12/1.29 Here is a proof with depth 1, length 11 :
% 1.12/1.29 % SZS output start Refutation
% See solution above
% 1.12/1.29 Formulae used in the proof : m__1905 m__1956 m__1979 m__ mAMDistr
% 1.12/1.29
%------------------------------------------------------------------------------