TSTP Solution File: HEN004-5 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : HEN004-5 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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:46 EDT 2023
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 79 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 28 ~; 28 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] : divide(divide(X,Y),X) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Z,Y] : divide(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] : divide(zero,X) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] :
( divide(X,Y) != zero
| divide(Y,X) != zero
| X = Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] : divide(X,X) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
divide(a,zero) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,plain,
! [X0,X1] : divide(divide(X0,X1),X0) = zero,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f9,plain,
! [X0,X1,X2] : divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f10,plain,
! [X0] : divide(zero,X0) = zero,
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f11,plain,
! [X0,X1] :
( divide(X0,X1) != zero
| divide(X1,X0) != zero
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f13,plain,
! [X0] : divide(X0,X0) = zero,
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f14,plain,
divide(a,zero) != a,
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f18,plain,
( spl0_0
<=> divide(divide(a,zero),a) = zero ),
introduced(split_symbol_definition) ).
fof(f20,plain,
( divide(divide(a,zero),a) != zero
| spl0_0 ),
inference(component_clause,[status(thm)],[f18]) ).
fof(f21,plain,
( spl0_1
<=> divide(a,divide(a,zero)) = zero ),
introduced(split_symbol_definition) ).
fof(f23,plain,
( divide(a,divide(a,zero)) != zero
| spl0_1 ),
inference(component_clause,[status(thm)],[f21]) ).
fof(f24,plain,
( divide(divide(a,zero),a) != zero
| divide(a,divide(a,zero)) != zero ),
inference(resolution,[status(thm)],[f11,f14]) ).
fof(f25,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f24,f18,f21]) ).
fof(f28,plain,
( zero != zero
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f8,f20]) ).
fof(f29,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f28]) ).
fof(f30,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f29]) ).
fof(f31,plain,
( spl0_2
<=> divide(divide(a,divide(a,zero)),zero) = zero ),
introduced(split_symbol_definition) ).
fof(f33,plain,
( divide(divide(a,divide(a,zero)),zero) != zero
| spl0_2 ),
inference(component_clause,[status(thm)],[f31]) ).
fof(f34,plain,
( spl0_3
<=> divide(zero,divide(a,divide(a,zero))) = zero ),
introduced(split_symbol_definition) ).
fof(f36,plain,
( divide(zero,divide(a,divide(a,zero))) != zero
| spl0_3 ),
inference(component_clause,[status(thm)],[f34]) ).
fof(f37,plain,
( divide(divide(a,divide(a,zero)),zero) != zero
| divide(zero,divide(a,divide(a,zero))) != zero
| spl0_1 ),
inference(resolution,[status(thm)],[f23,f11]) ).
fof(f38,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_1 ),
inference(split_clause,[status(thm)],[f37,f31,f34,f21]) ).
fof(f53,plain,
! [X0,X1] : divide(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)) = zero,
inference(paramodulation,[status(thm)],[f10,f9]) ).
fof(f67,plain,
( spl0_4
<=> divide(divide(divide(a,divide(a,zero)),zero),zero) = zero ),
introduced(split_symbol_definition) ).
fof(f69,plain,
( divide(divide(divide(a,divide(a,zero)),zero),zero) != zero
| spl0_4 ),
inference(component_clause,[status(thm)],[f67]) ).
fof(f70,plain,
( spl0_5
<=> divide(zero,divide(divide(a,divide(a,zero)),zero)) = zero ),
introduced(split_symbol_definition) ).
fof(f72,plain,
( divide(zero,divide(divide(a,divide(a,zero)),zero)) != zero
| spl0_5 ),
inference(component_clause,[status(thm)],[f70]) ).
fof(f73,plain,
( divide(divide(divide(a,divide(a,zero)),zero),zero) != zero
| divide(zero,divide(divide(a,divide(a,zero)),zero)) != zero
| spl0_2 ),
inference(resolution,[status(thm)],[f33,f11]) ).
fof(f74,plain,
( ~ spl0_4
| ~ spl0_5
| spl0_2 ),
inference(split_clause,[status(thm)],[f73,f67,f70,f31]) ).
fof(f77,plain,
( zero != zero
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f10,f36]) ).
fof(f78,plain,
( $false
| spl0_3 ),
inference(trivial_equality_resolution,[status(esa)],[f77]) ).
fof(f79,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f78]) ).
fof(f180,plain,
! [X0] : divide(divide(divide(X0,divide(X0,zero)),zero),zero) = zero,
inference(paramodulation,[status(thm)],[f13,f53]) ).
fof(f205,plain,
( zero != zero
| spl0_4 ),
inference(backward_demodulation,[status(thm)],[f180,f69]) ).
fof(f206,plain,
( $false
| spl0_4 ),
inference(trivial_equality_resolution,[status(esa)],[f205]) ).
fof(f207,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f206]) ).
fof(f208,plain,
( zero != zero
| spl0_5 ),
inference(forward_demodulation,[status(thm)],[f10,f72]) ).
fof(f209,plain,
( $false
| spl0_5 ),
inference(trivial_equality_resolution,[status(esa)],[f208]) ).
fof(f210,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f209]) ).
fof(f211,plain,
$false,
inference(sat_refutation,[status(thm)],[f25,f30,f38,f74,f79,f207,f210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN004-5 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 09:28:50 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Drodi V3.5.1
% 0.12/0.35 % Refutation found
% 0.12/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.28/0.57 % Elapsed time: 0.021361 seconds
% 0.28/0.57 % CPU time: 0.068018 seconds
% 0.28/0.57 % Memory used: 9.957 MB
%------------------------------------------------------------------------------