TSTP Solution File: RNG104+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG104+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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.48s 0.65s
% Output : Refutation 0.48s
% 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+1.p',unknown),
[] ).
cnf(4,axiom,
aElement0(xz),
file('RNG104+1.p',unknown),
[] ).
cnf(5,axiom,
aElement0(xu),
file('RNG104+1.p',unknown),
[] ).
cnf(17,axiom,
equal(sdtasdt0(xc,xu),xx),
file('RNG104+1.p',unknown),
[] ).
cnf(36,axiom,
~ equal(sdtasdt0(xc,sdtasdt0(xu,xz)),sdtasdt0(xz,xx)),
file('RNG104+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| aElement0(sdtasdt0(v,u)) ),
file('RNG104+1.p',unknown),
[] ).
cnf(50,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| equal(sdtasdt0(v,u),sdtasdt0(u,v)) ),
file('RNG104+1.p',unknown),
[] ).
cnf(77,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ aElement0(w)
| equal(sdtasdt0(sdtasdt0(w,v),u),sdtasdt0(w,sdtasdt0(v,u))) ),
file('RNG104+1.p',unknown),
[] ).
cnf(138,plain,
( ~ aElement0(xu)
| ~ aElement0(xc)
| aElement0(xx) ),
inference(spr,[status(thm),theory(equality)],[17,38]),
[iquote('0:SpR:17.0,38.2')] ).
cnf(147,plain,
aElement0(xx),
inference(ssi,[status(thm)],[138,3,5]),
[iquote('0:SSi:138.1,138.0,3.0,5.0')] ).
cnf(1190,plain,
( ~ aElement0(u)
| ~ aElement0(xu)
| ~ aElement0(xc)
| equal(sdtasdt0(xc,sdtasdt0(xu,u)),sdtasdt0(xx,u)) ),
inference(spr,[status(thm),theory(equality)],[17,77]),
[iquote('0:SpR:17.0,77.3')] ).
cnf(1195,plain,
( ~ aElement0(u)
| equal(sdtasdt0(xc,sdtasdt0(xu,u)),sdtasdt0(xx,u)) ),
inference(ssi,[status(thm)],[1190,3,5]),
[iquote('0:SSi:1190.2,1190.1,3.0,5.0')] ).
cnf(1258,plain,
( ~ aElement0(xz)
| ~ equal(sdtasdt0(xz,xx),sdtasdt0(xx,xz)) ),
inference(spl,[status(thm),theory(equality)],[1195,36]),
[iquote('0:SpL:1195.1,36.0')] ).
cnf(1259,plain,
~ equal(sdtasdt0(xz,xx),sdtasdt0(xx,xz)),
inference(ssi,[status(thm)],[1258,4]),
[iquote('0:SSi:1258.0,4.0')] ).
cnf(1332,plain,
( ~ aElement0(xz)
| ~ aElement0(xx)
| ~ equal(sdtasdt0(xx,xz),sdtasdt0(xx,xz)) ),
inference(spl,[status(thm),theory(equality)],[50,1259]),
[iquote('0:SpL:50.2,1259.0')] ).
cnf(1335,plain,
( ~ aElement0(xz)
| ~ aElement0(xx) ),
inference(obv,[status(thm),theory(equality)],[1332]),
[iquote('0:Obv:1332.2')] ).
cnf(1336,plain,
$false,
inference(ssi,[status(thm)],[1335,147,4]),
[iquote('0:SSi:1335.1,1335.0,147.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG104+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n021.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 : Mon May 30 13:40:14 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.48/0.65
% 0.48/0.65 SPASS V 3.9
% 0.48/0.65 SPASS beiseite: Proof found.
% 0.48/0.65 % SZS status Theorem
% 0.48/0.65 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.65 SPASS derived 846 clauses, backtracked 44 clauses, performed 2 splits and kept 415 clauses.
% 0.48/0.65 SPASS allocated 99336 KBytes.
% 0.48/0.65 SPASS spent 0:00:00.28 on the problem.
% 0.48/0.65 0:00:00.03 for the input.
% 0.48/0.65 0:00:00.12 for the FLOTTER CNF translation.
% 0.48/0.65 0:00:00.01 for inferences.
% 0.48/0.65 0:00:00.00 for the backtracking.
% 0.48/0.65 0:00:00.09 for the reduction.
% 0.48/0.65
% 0.48/0.65
% 0.48/0.65 Here is a proof with depth 3, length 17 :
% 0.48/0.65 % SZS output start Refutation
% See solution above
% 0.48/0.65 Formulae used in the proof : m__1905 m__1933 m__1956 m__ mSortsB_02 mMulComm mMulAsso
% 0.48/0.65
%------------------------------------------------------------------------------