TSTP Solution File: GRP703+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GRP703+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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:12:35 EDT 2023
% Result : Theorem 3.87s 0.89s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 32 unt; 0 def)
% Number of atoms : 93 ( 63 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 64 ( 30 ~; 27 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 59 (; 51 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,A] : mult(A,ld(A,B)) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,A] : ld(A,mult(A,B)) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,A] : mult(rd(A,B),B) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A] : mult(A,unit) = A,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [C,B,A] : mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [B,A] : mult(op_c,mult(A,B)) = mult(mult(op_c,A),B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [B,A] : mult(A,mult(B,op_c)) = mult(mult(A,B),op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [B,A] : mult(A,mult(op_c,B)) = mult(mult(A,op_c),B),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [A] : op_d = ld(A,mult(op_c,A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [B,A] : op_e = mult(mult(rd(op_c,mult(A,B)),B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,conjecture,
! [X2,X3] :
( mult(op_e,mult(X2,X3)) = mult(mult(op_e,X2),X3)
& mult(X2,mult(X3,op_e)) = mult(mult(X2,X3),op_e)
& mult(X2,mult(op_e,X3)) = mult(mult(X2,op_e),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
~ ! [X2,X3] :
( mult(op_e,mult(X2,X3)) = mult(mult(op_e,X2),X3)
& mult(X2,mult(X3,op_e)) = mult(mult(X2,X3),op_e)
& mult(X2,mult(op_e,X3)) = mult(mult(X2,op_e),X3) ),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f16,plain,
! [X0,X1] : mult(X0,ld(X0,X1)) = X1,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f17,plain,
! [X0,X1] : ld(X0,mult(X0,X1)) = X1,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f18,plain,
! [X0,X1] : mult(rd(X0,X1),X1) = X0,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f20,plain,
! [X0] : mult(X0,unit) = X0,
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f22,plain,
! [X0,X1,X2] : mult(X0,mult(X1,mult(X1,X2))) = mult(mult(mult(X0,X1),X1),X2),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f23,plain,
! [X0,X1] : mult(op_c,mult(X0,X1)) = mult(mult(op_c,X0),X1),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f24,plain,
! [X0,X1] : mult(X0,mult(X1,op_c)) = mult(mult(X0,X1),op_c),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f25,plain,
! [X0,X1] : mult(X0,mult(op_c,X1)) = mult(mult(X0,op_c),X1),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f26,plain,
! [X0] : op_d = ld(X0,mult(op_c,X0)),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f27,plain,
! [X0,X1] : op_e = mult(mult(rd(op_c,mult(X0,X1)),X1),X0),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f29,plain,
? [X2,X3] :
( mult(op_e,mult(X2,X3)) != mult(mult(op_e,X2),X3)
| mult(X2,mult(X3,op_e)) != mult(mult(X2,X3),op_e)
| mult(X2,mult(op_e,X3)) != mult(mult(X2,op_e),X3) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f30,plain,
( ? [X2,X3] : mult(op_e,mult(X2,X3)) != mult(mult(op_e,X2),X3)
| ? [X2,X3] : mult(X2,mult(X3,op_e)) != mult(mult(X2,X3),op_e)
| ? [X2,X3] : mult(X2,mult(op_e,X3)) != mult(mult(X2,op_e),X3) ),
inference(miniscoping,[status(esa)],[f29]) ).
fof(f31,plain,
( mult(op_e,mult(sk0_0,sk0_1)) != mult(mult(op_e,sk0_0),sk0_1)
| mult(sk0_2,mult(sk0_3,op_e)) != mult(mult(sk0_2,sk0_3),op_e)
| mult(sk0_4,mult(op_e,sk0_5)) != mult(mult(sk0_4,op_e),sk0_5) ),
inference(skolemization,[status(esa)],[f30]) ).
fof(f32,plain,
( mult(op_e,mult(sk0_0,sk0_1)) != mult(mult(op_e,sk0_0),sk0_1)
| mult(sk0_2,mult(sk0_3,op_e)) != mult(mult(sk0_2,sk0_3),op_e)
| mult(sk0_4,mult(op_e,sk0_5)) != mult(mult(sk0_4,op_e),sk0_5) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f33,plain,
( spl0_0
<=> mult(op_e,mult(sk0_0,sk0_1)) = mult(mult(op_e,sk0_0),sk0_1) ),
introduced(split_symbol_definition) ).
fof(f35,plain,
( mult(op_e,mult(sk0_0,sk0_1)) != mult(mult(op_e,sk0_0),sk0_1)
| spl0_0 ),
inference(component_clause,[status(thm)],[f33]) ).
fof(f36,plain,
( spl0_1
<=> mult(sk0_2,mult(sk0_3,op_e)) = mult(mult(sk0_2,sk0_3),op_e) ),
introduced(split_symbol_definition) ).
fof(f38,plain,
( mult(sk0_2,mult(sk0_3,op_e)) != mult(mult(sk0_2,sk0_3),op_e)
| spl0_1 ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,plain,
( spl0_2
<=> mult(sk0_4,mult(op_e,sk0_5)) = mult(mult(sk0_4,op_e),sk0_5) ),
introduced(split_symbol_definition) ).
fof(f41,plain,
( mult(sk0_4,mult(op_e,sk0_5)) != mult(mult(sk0_4,op_e),sk0_5)
| spl0_2 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f32,f33,f36,f39]) ).
fof(f3279,plain,
! [X0,X1] : mult(X0,mult(X1,mult(X1,unit))) = mult(mult(X0,X1),X1),
inference(paramodulation,[status(thm)],[f22,f20]) ).
fof(f3280,plain,
! [X0,X1] : mult(X0,mult(X1,X1)) = mult(mult(X0,X1),X1),
inference(forward_demodulation,[status(thm)],[f20,f3279]) ).
fof(f4971,plain,
! [X0,X1] : ld(mult(X0,X1),mult(X0,mult(X1,X1))) = X1,
inference(paramodulation,[status(thm)],[f3280,f17]) ).
fof(f5822,plain,
op_d = op_c,
inference(paramodulation,[status(thm)],[f26,f4971]) ).
fof(f5902,plain,
! [X0] : op_c = ld(X0,mult(op_c,X0)),
inference(backward_demodulation,[status(thm)],[f5822,f26]) ).
fof(f5908,plain,
! [X0] : mult(X0,op_c) = mult(op_c,X0),
inference(paramodulation,[status(thm)],[f5902,f16]) ).
fof(f6090,plain,
! [X0] : op_e = mult(rd(op_c,mult(X0,X0)),mult(X0,X0)),
inference(paramodulation,[status(thm)],[f3280,f27]) ).
fof(f6091,plain,
op_e = op_c,
inference(forward_demodulation,[status(thm)],[f18,f6090]) ).
fof(f6578,plain,
( mult(sk0_4,mult(op_e,sk0_5)) != mult(mult(sk0_4,op_c),sk0_5)
| spl0_2 ),
inference(backward_demodulation,[status(thm)],[f6091,f41]) ).
fof(f6579,plain,
( mult(sk0_4,mult(op_c,sk0_5)) != mult(mult(sk0_4,op_c),sk0_5)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f6091,f6578]) ).
fof(f6580,plain,
( mult(sk0_4,mult(op_c,sk0_5)) != mult(sk0_4,mult(op_c,sk0_5))
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f25,f6579]) ).
fof(f6581,plain,
( $false
| spl0_2 ),
inference(trivial_equality_resolution,[status(esa)],[f6580]) ).
fof(f6582,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f6581]) ).
fof(f6583,plain,
( mult(op_c,mult(sk0_0,sk0_1)) != mult(mult(op_e,sk0_0),sk0_1)
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f6091,f35]) ).
fof(f6584,plain,
( mult(op_c,mult(sk0_0,sk0_1)) != mult(mult(op_c,sk0_0),sk0_1)
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f6091,f6583]) ).
fof(f6585,plain,
( mult(op_c,mult(sk0_0,sk0_1)) != mult(op_c,mult(sk0_0,sk0_1))
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f23,f6584]) ).
fof(f6586,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f6585]) ).
fof(f6587,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f6586]) ).
fof(f6590,plain,
( mult(sk0_2,mult(sk0_3,op_c)) != mult(mult(sk0_2,sk0_3),op_e)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f6091,f38]) ).
fof(f6591,plain,
( mult(sk0_2,mult(op_c,sk0_3)) != mult(mult(sk0_2,sk0_3),op_e)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f5908,f6590]) ).
fof(f6592,plain,
( mult(sk0_2,mult(op_c,sk0_3)) != mult(mult(sk0_2,sk0_3),op_c)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f6091,f6591]) ).
fof(f6593,plain,
( mult(sk0_2,mult(op_c,sk0_3)) != mult(sk0_2,mult(sk0_3,op_c))
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f24,f6592]) ).
fof(f6594,plain,
( mult(sk0_2,mult(op_c,sk0_3)) != mult(sk0_2,mult(op_c,sk0_3))
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f5908,f6593]) ).
fof(f6595,plain,
( $false
| spl0_1 ),
inference(trivial_equality_resolution,[status(esa)],[f6594]) ).
fof(f6596,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f6595]) ).
fof(f6597,plain,
$false,
inference(sat_refutation,[status(thm)],[f42,f6582,f6587,f6596]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP703+1 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n018.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 : 300
% 0.13/0.35 % DateTime : Tue May 30 11:40:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 3.87/0.89 % Refutation found
% 3.87/0.89 % SZS status Theorem for theBenchmark: Theorem is valid
% 3.87/0.89 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 4.63/0.93 % Elapsed time: 0.565398 seconds
% 4.63/0.93 % CPU time: 4.340057 seconds
% 4.63/0.93 % Memory used: 173.576 MB
%------------------------------------------------------------------------------