TSTP Solution File: RNG104+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG104+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 8 unt; 0 nHn; 17 RR)
% Number of literals : 34 ( 0 equ; 22 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aElement0(xc),
file('RNG104+2.p',unknown),
[] ).
cnf(6,axiom,
aElement0(xz),
file('RNG104+2.p',unknown),
[] ).
cnf(7,axiom,
aElement0(xu),
file('RNG104+2.p',unknown),
[] ).
cnf(21,axiom,
equal(sdtasdt0(xc,xu),xx),
file('RNG104+2.p',unknown),
[] ).
cnf(40,axiom,
~ equal(sdtasdt0(xc,sdtasdt0(xu,xz)),sdtasdt0(xz,xx)),
file('RNG104+2.p',unknown),
[] ).
cnf(42,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| aElement0(sdtasdt0(v,u)) ),
file('RNG104+2.p',unknown),
[] ).
cnf(54,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
file('RNG104+2.p',unknown),
[] ).
cnf(81,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| equal(sdtasdt0(sdtasdt0(w,v),u),sdtasdt0(w,sdtasdt0(v,u))) ),
file('RNG104+2.p',unknown),
[] ).
cnf(144,plain,
( ~ aElement0(xu)
| ~ aElement0(xc)
| aElement0(xx) ),
inference(spr,[status(thm),theory(equality)],[21,42]),
[iquote('0:SpR:21.0,42.2')] ).
cnf(155,plain,
aElement0(xx),
inference(ssi,[status(thm)],[144,3,7]),
[iquote('0:SSi:144.1,144.0,3.0,7.0')] ).
cnf(1058,plain,
( ~ aElement0(u)
| ~ aElement0(xu)
| ~ aElement0(xc)
| equal(sdtasdt0(xc,sdtasdt0(xu,u)),sdtasdt0(xx,u)) ),
inference(spr,[status(thm),theory(equality)],[21,81]),
[iquote('0:SpR:21.0,81.3')] ).
cnf(1064,plain,
( ~ aElement0(u)
| equal(sdtasdt0(xc,sdtasdt0(xu,u)),sdtasdt0(xx,u)) ),
inference(ssi,[status(thm)],[1058,3,7]),
[iquote('0:SSi:1058.2,1058.1,3.0,7.0')] ).
cnf(1917,plain,
( ~ aElement0(xz)
| ~ equal(sdtasdt0(xz,xx),sdtasdt0(xx,xz)) ),
inference(spl,[status(thm),theory(equality)],[1064,40]),
[iquote('0:SpL:1064.1,40.0')] ).
cnf(1918,plain,
~ equal(sdtasdt0(xz,xx),sdtasdt0(xx,xz)),
inference(ssi,[status(thm)],[1917,6]),
[iquote('0:SSi:1917.0,6.0')] ).
cnf(2002,plain,
( ~ aElement0(xz)
| ~ aElement0(xx)
| ~ equal(sdtasdt0(xx,xz),sdtasdt0(xx,xz)) ),
inference(spl,[status(thm),theory(equality)],[54,1918]),
[iquote('0:SpL:54.2,1918.0')] ).
cnf(2005,plain,
( ~ aElement0(xz)
| ~ aElement0(xx) ),
inference(obv,[status(thm),theory(equality)],[2002]),
[iquote('0:Obv:2002.2')] ).
cnf(2006,plain,
$false,
inference(ssi,[status(thm)],[2005,155,6]),
[iquote('0:SSi:2005.1,2005.0,155.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG104+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 05:27:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.55/0.76
% 0.55/0.76 SPASS V 3.9
% 0.55/0.76 SPASS beiseite: Proof found.
% 0.55/0.76 % SZS status Theorem
% 0.55/0.76 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.76 SPASS derived 1169 clauses, backtracked 45 clauses, performed 2 splits and kept 573 clauses.
% 0.55/0.76 SPASS allocated 99613 KBytes.
% 0.55/0.76 SPASS spent 0:00:00.40 on the problem.
% 0.55/0.76 0:00:00.03 for the input.
% 0.55/0.76 0:00:00.12 for the FLOTTER CNF translation.
% 0.55/0.76 0:00:00.01 for inferences.
% 0.55/0.76 0:00:00.00 for the backtracking.
% 0.55/0.76 0:00:00.20 for the reduction.
% 0.55/0.76
% 0.55/0.76
% 0.55/0.76 Here is a proof with depth 3, length 17 :
% 0.55/0.76 % SZS output start Refutation
% See solution above
% 0.55/0.76 Formulae used in the proof : m__1905 m__1933 m__1956 m__ mSortsB_02 mMulComm mMulAsso
% 0.55/0.76
%------------------------------------------------------------------------------