TSTP Solution File: GRP135-1.002 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : GRP135-1.002 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n012.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 : Tue Apr 30 20:19:30 EDT 2024
% Result : Unsatisfiable 0.11s 0.37s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 65 ( 9 unt; 0 def)
% Number of atoms : 154 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 164 ( 75 ~; 81 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 9 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 48 ( 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y] :
( ~ group_element(X)
| ~ group_element(Y)
| product(X,Y,e_1)
| product(X,Y,e_2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X,Y,W,Z] :
( ~ product(X,Y,W)
| ~ product(X,Y,Z)
| equalish(W,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [W,Y,X,Z] :
( ~ product(W,Y,X)
| ~ product(Z,Y,X)
| equalish(W,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
! [Y,X,Z1,Z2] :
( ~ product(Y,X,Z1)
| ~ product(Z1,Y,Z2)
| product(Z2,Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,plain,
group_element(e_1),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f11,plain,
group_element(e_2),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f12,plain,
~ equalish(e_1,e_2),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f13,plain,
~ equalish(e_2,e_1),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( ~ group_element(X0)
| ~ group_element(X1)
| product(X0,X1,e_1)
| product(X0,X1,e_2) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f15,plain,
! [W,Z] :
( ! [X,Y] :
( ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(W,Z) ),
inference(miniscoping,[status(esa)],[f6]) ).
fof(f16,plain,
! [X0,X1,X2,X3] :
( ~ product(X0,X1,X2)
| ~ product(X0,X1,X3)
| equalish(X2,X3) ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f19,plain,
! [W,Z] :
( ! [Y,X] :
( ~ product(W,Y,X)
| ~ product(Z,Y,X) )
| equalish(W,Z) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f20,plain,
! [X0,X1,X2,X3] :
( ~ product(X0,X1,X2)
| ~ product(X3,X1,X2)
| equalish(X0,X3) ),
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f21,plain,
! [Y,X,Z2] :
( ! [Z1] :
( ~ product(Y,X,Z1)
| ~ product(Z1,Y,Z2) )
| product(Z2,Y,X) ),
inference(miniscoping,[status(esa)],[f9]) ).
fof(f22,plain,
! [X0,X1,X2,X3] :
( ~ product(X0,X1,X2)
| ~ product(X2,X0,X3)
| product(X3,X0,X1) ),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f23,plain,
! [X0] :
( ~ group_element(X0)
| product(e_2,X0,e_1)
| product(e_2,X0,e_2) ),
inference(resolution,[status(thm)],[f14,f11]) ).
fof(f24,plain,
! [X0] :
( ~ group_element(X0)
| product(e_1,X0,e_1)
| product(e_1,X0,e_2) ),
inference(resolution,[status(thm)],[f14,f10]) ).
fof(f25,plain,
( spl0_0
<=> product(e_2,e_2,e_1) ),
introduced(split_symbol_definition) ).
fof(f26,plain,
( product(e_2,e_2,e_1)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f25]) ).
fof(f28,plain,
( spl0_1
<=> product(e_2,e_2,e_2) ),
introduced(split_symbol_definition) ).
fof(f29,plain,
( product(e_2,e_2,e_2)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f28]) ).
fof(f31,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(resolution,[status(thm)],[f23,f11]) ).
fof(f32,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f31,f25,f28]) ).
fof(f33,plain,
( spl0_2
<=> product(e_2,e_1,e_1) ),
introduced(split_symbol_definition) ).
fof(f34,plain,
( product(e_2,e_1,e_1)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f33]) ).
fof(f36,plain,
( spl0_3
<=> product(e_2,e_1,e_2) ),
introduced(split_symbol_definition) ).
fof(f37,plain,
( product(e_2,e_1,e_2)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2) ),
inference(resolution,[status(thm)],[f23,f10]) ).
fof(f40,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f39,f33,f36]) ).
fof(f41,plain,
( spl0_4
<=> product(e_1,e_2,e_1) ),
introduced(split_symbol_definition) ).
fof(f42,plain,
( product(e_1,e_2,e_1)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f41]) ).
fof(f44,plain,
( spl0_5
<=> product(e_1,e_2,e_2) ),
introduced(split_symbol_definition) ).
fof(f45,plain,
( product(e_1,e_2,e_2)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f44]) ).
fof(f47,plain,
( product(e_1,e_2,e_1)
| product(e_1,e_2,e_2) ),
inference(resolution,[status(thm)],[f24,f11]) ).
fof(f48,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f47,f41,f44]) ).
fof(f49,plain,
( spl0_6
<=> product(e_1,e_1,e_1) ),
introduced(split_symbol_definition) ).
fof(f50,plain,
( product(e_1,e_1,e_1)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f49]) ).
fof(f52,plain,
( spl0_7
<=> product(e_1,e_1,e_2) ),
introduced(split_symbol_definition) ).
fof(f53,plain,
( product(e_1,e_1,e_2)
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f52]) ).
fof(f55,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(resolution,[status(thm)],[f24,f10]) ).
fof(f56,plain,
( spl0_6
| spl0_7 ),
inference(split_clause,[status(thm)],[f55,f49,f52]) ).
fof(f60,plain,
! [X0] :
( ~ product(e_1,X0,e_2)
| product(e_1,e_1,X0)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f34,f22]) ).
fof(f68,plain,
! [X0] :
( ~ product(e_1,X0,e_1)
| product(e_1,e_1,X0)
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f50,f22]) ).
fof(f70,plain,
( product(e_1,e_1,e_2)
| ~ spl0_4
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f42,f68]) ).
fof(f78,plain,
! [X0] :
( ~ product(e_1,e_1,X0)
| equalish(X0,e_2)
| ~ spl0_4
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f70,f16]) ).
fof(f83,plain,
( equalish(e_1,e_2)
| ~ spl0_4
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f78,f50]) ).
fof(f84,plain,
( $false
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f83,f12]) ).
fof(f85,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(contradiction_clause,[status(thm)],[f84]) ).
fof(f87,plain,
! [X0] :
( ~ product(X0,e_2,e_2)
| equalish(X0,e_1)
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f45,f20]) ).
fof(f90,plain,
! [X0] :
( ~ product(e_2,X0,e_1)
| product(e_2,e_2,X0)
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f45,f22]) ).
fof(f125,plain,
! [X0] :
( ~ product(e_1,X0,e_2)
| product(e_2,e_1,X0)
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f37,f22]) ).
fof(f126,plain,
( product(e_2,e_1,e_1)
| ~ spl0_3
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f125,f53]) ).
fof(f127,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f126,f33,f36,f52]) ).
fof(f128,plain,
( product(e_1,e_1,e_1)
| ~ spl0_2
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f60,f53]) ).
fof(f129,plain,
( spl0_6
| ~ spl0_2
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f128,f49,f33,f52]) ).
fof(f158,plain,
( equalish(e_2,e_1)
| ~ spl0_5
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f87,f29]) ).
fof(f159,plain,
( $false
| ~ spl0_5
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f158,f13]) ).
fof(f160,plain,
( ~ spl0_5
| ~ spl0_1 ),
inference(contradiction_clause,[status(thm)],[f159]) ).
fof(f161,plain,
( product(e_2,e_2,e_2)
| ~ spl0_0
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f26,f90]) ).
fof(f162,plain,
( spl0_1
| ~ spl0_0
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f161,f28,f25,f44]) ).
fof(f167,plain,
$false,
inference(sat_refutation,[status(thm)],[f32,f40,f48,f56,f85,f127,f129,f160,f162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP135-1.002 : TPTP v8.1.2. Released v1.2.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.35 % Computer : n012.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8042.1875MB
% 0.11/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Tue Apr 30 00:17:41 EDT 2024
% 0.11/0.35 % CPUTime :
% 0.11/0.36 % Drodi V3.6.0
% 0.11/0.37 % Refutation found
% 0.11/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.39 % Elapsed time: 0.017936 seconds
% 0.11/0.39 % CPU time: 0.063024 seconds
% 0.11/0.39 % Total memory used: 2.725 MB
% 0.11/0.39 % Net memory used: 2.596 MB
%------------------------------------------------------------------------------