TSTP Solution File: RNG040-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : RNG040-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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 : 300s
% DateTime : Wed May 31 12:32:41 EDT 2023
% Result : Unsatisfiable 0.15s 0.38s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 56 ( 28 ~; 26 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 33 (; 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X,Y,Z] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [Y,X,V1,Z,V2,V3,V4] :
( ~ product(Y,X,V1)
| ~ product(Z,X,V2)
| ~ sum(Y,Z,V3)
| ~ product(V3,X,V4)
| sum(V1,V2,V4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
sum(b,c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,negated_conjecture,
product(d,a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f25,negated_conjecture,
product(b,a,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,negated_conjecture,
product(c,a,n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,negated_conjecture,
~ sum(l,n,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ sum(X0,X1,X2)
| sum(X1,X0,X2) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f47,plain,
! [V1,V2,V4] :
( ! [X,V3] :
( ! [Y,Z] :
( ~ product(Y,X,V1)
| ~ product(Z,X,V2)
| ~ sum(Y,Z,V3) )
| ~ product(V3,X,V4) )
| sum(V1,V2,V4) ),
inference(miniscoping,[status(esa)],[f14]) ).
fof(f48,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ product(X0,X1,X2)
| ~ product(X3,X1,X4)
| ~ sum(X0,X3,X5)
| ~ product(X5,X1,X6)
| sum(X2,X4,X6) ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f60,plain,
sum(b,c,d),
inference(cnf_transformation,[status(esa)],[f23]) ).
fof(f61,plain,
product(d,a,additive_identity),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f62,plain,
product(b,a,l),
inference(cnf_transformation,[status(esa)],[f25]) ).
fof(f63,plain,
product(c,a,n),
inference(cnf_transformation,[status(esa)],[f26]) ).
fof(f64,plain,
~ sum(l,n,additive_identity),
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f66,plain,
sum(c,b,d),
inference(resolution,[status(thm)],[f38,f60]) ).
fof(f190,plain,
! [X0,X1,X2,X3] :
( ~ product(X0,a,X1)
| ~ sum(c,X0,X2)
| ~ product(X2,a,X3)
| sum(n,X1,X3) ),
inference(resolution,[status(thm)],[f48,f63]) ).
fof(f215,plain,
! [X0,X1] :
( ~ sum(c,b,X0)
| ~ product(X0,a,X1)
| sum(n,l,X1) ),
inference(resolution,[status(thm)],[f190,f62]) ).
fof(f254,plain,
( spl0_13
<=> sum(c,b,d) ),
introduced(split_symbol_definition) ).
fof(f256,plain,
( ~ sum(c,b,d)
| spl0_13 ),
inference(component_clause,[status(thm)],[f254]) ).
fof(f257,plain,
( spl0_14
<=> sum(n,l,additive_identity) ),
introduced(split_symbol_definition) ).
fof(f258,plain,
( sum(n,l,additive_identity)
| ~ spl0_14 ),
inference(component_clause,[status(thm)],[f257]) ).
fof(f260,plain,
( ~ sum(c,b,d)
| sum(n,l,additive_identity) ),
inference(resolution,[status(thm)],[f215,f61]) ).
fof(f261,plain,
( ~ spl0_13
| spl0_14 ),
inference(split_clause,[status(thm)],[f260,f254,f257]) ).
fof(f262,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f256,f66]) ).
fof(f263,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f262]) ).
fof(f269,plain,
( sum(l,n,additive_identity)
| ~ spl0_14 ),
inference(resolution,[status(thm)],[f258,f38]) ).
fof(f270,plain,
( $false
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f269,f64]) ).
fof(f271,plain,
~ spl0_14,
inference(contradiction_clause,[status(thm)],[f270]) ).
fof(f272,plain,
$false,
inference(sat_refutation,[status(thm)],[f261,f263,f271]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : RNG040-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n009.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 300
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Tue May 30 10:31:16 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.15/0.38 % Refutation found
% 0.15/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.32/0.60 % Elapsed time: 0.062075 seconds
% 0.32/0.60 % CPU time: 0.151863 seconds
% 0.32/0.60 % Memory used: 12.739 MB
%------------------------------------------------------------------------------