TSTP Solution File: RNG045+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : RNG045+1 : 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:18 EDT 2022
% Result : Theorem 7.41s 7.60s
% Output : Refutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
aScalar0(xx),
file('RNG045+1.p',unknown),
[] ).
cnf(4,axiom,
aScalar0(xy),
file('RNG045+1.p',unknown),
[] ).
cnf(5,axiom,
aScalar0(xu),
file('RNG045+1.p',unknown),
[] ).
cnf(6,axiom,
aScalar0(xv),
file('RNG045+1.p',unknown),
[] ).
cnf(26,axiom,
equal(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))),
file('RNG045+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ aScalar0(u)
| ~ aScalar0(v)
| ~ aScalar0(w)
| equal(sdtasdt0(w,sdtpldt0(v,u)),sdtpldt0(sdtasdt0(w,v),sdtasdt0(w,u))) ),
file('RNG045+1.p',unknown),
[] ).
cnf(31,axiom,
~ equal(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),
file('RNG045+1.p',unknown),
[] ).
cnf(32,plain,
~ equal(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),
inference(rew,[status(thm),theory(equality)],[26,31]),
[iquote('0:Rew:26.0,31.0')] ).
cnf(707,plain,
( ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xx)
| ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))) ),
inference(spl,[status(thm),theory(equality)],[30,32]),
[iquote('0:SpL:30.3,32.0')] ).
cnf(708,plain,
~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),
inference(ssi,[status(thm)],[707,3,5,6]),
[iquote('0:SSi:707.2,707.1,707.0,3.0,5.0,6.0')] ).
cnf(11792,plain,
( ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xy)
| ~ equal(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))) ),
inference(spl,[status(thm),theory(equality)],[30,708]),
[iquote('0:SpL:30.3,708.0')] ).
cnf(11794,plain,
( ~ aScalar0(xv)
| ~ aScalar0(xu)
| ~ aScalar0(xy) ),
inference(obv,[status(thm),theory(equality)],[11792]),
[iquote('0:Obv:11792.3')] ).
cnf(11795,plain,
$false,
inference(ssi,[status(thm)],[11794,4,5,6]),
[iquote('0:SSi:11794.2,11794.1,11794.0,4.0,5.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG045+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 08:11:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 7.41/7.60
% 7.41/7.60 SPASS V 3.9
% 7.41/7.60 SPASS beiseite: Proof found.
% 7.41/7.60 % SZS status Theorem
% 7.41/7.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.41/7.60 SPASS derived 5814 clauses, backtracked 0 clauses, performed 0 splits and kept 1036 clauses.
% 7.41/7.60 SPASS allocated 118116 KBytes.
% 7.41/7.60 SPASS spent 0:00:04.96 on the problem.
% 7.41/7.60 0:00:00.04 for the input.
% 7.41/7.60 0:00:00.03 for the FLOTTER CNF translation.
% 7.41/7.60 0:00:00.07 for inferences.
% 7.41/7.60 0:00:00.00 for the backtracking.
% 7.41/7.60 0:00:04.80 for the reduction.
% 7.41/7.60
% 7.41/7.60
% 7.41/7.60 Here is a proof with depth 2, length 13 :
% 7.41/7.60 % SZS output start Refutation
% See solution above
% 7.41/7.60 Formulae used in the proof : m__674 m__733 mDistr m__
% 7.41/7.60
%------------------------------------------------------------------------------