TSTP Solution File: HWV023-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : HWV023-1 : TPTP v8.1.2. Released v2.5.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:59 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 61 ( 25 unt; 0 def)
% Number of atoms : 121 ( 31 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 105 ( 45 ~; 55 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X_1] : gt(plus(X_1,n1),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X_3,Y_4,Z_5] :
( minus(X_3,Y_4) = Z_5
| plus(Z_5,Y_4) != X_3
| def_10(Y_4,X_3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [Y_4,X_3] :
( ~ def_10(Y_4,X_3)
| X_3 != Y_4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [X_31] : plus(n0,X_31) = X_31,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f21,axiom,
! [X_t_32] : level(X_t_32) = int_level(X_t_32),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
! [X_t_35] :
( int_level(X_t_35) != n0
| p_Empty(X_t_35) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f71,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| ~ p_Rd(X_t_42)
| ~ gt(int_level(X_t_42),n0)
| int_level(plus(X_t_42,n1)) = minus(int_level(X_t_42),n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f91,negated_conjecture,
level(t_139) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f92,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f93,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f94,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f95,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,plain,
! [X0] : gt(plus(X0,n1),n0),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f101,plain,
! [X_3,Y_4] :
( ! [Z_5] :
( minus(X_3,Y_4) = Z_5
| plus(Z_5,Y_4) != X_3 )
| def_10(Y_4,X_3) ),
inference(miniscoping,[status(esa)],[f5]) ).
fof(f102,plain,
! [X0,X1,X2] :
( minus(X0,X1) = X2
| plus(X2,X1) != X0
| def_10(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f101]) ).
fof(f104,plain,
! [X0,X1] :
( ~ def_10(X0,X1)
| X1 != X0 ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f117,plain,
! [X0] : plus(n0,X0) = X0,
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f119,plain,
! [X0] : level(X0) = int_level(X0),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f122,plain,
! [X0] :
( int_level(X0) != n0
| p_Empty(X0) ),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f171,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| ~ p_Rd(X0)
| ~ gt(int_level(X0),n0)
| int_level(plus(X0,n1)) = minus(int_level(X0),n1) ),
inference(cnf_transformation,[status(esa)],[f71]) ).
fof(f191,plain,
level(t_139) = n1,
inference(cnf_transformation,[status(esa)],[f91]) ).
fof(f192,plain,
~ p_Wr(t_139),
inference(cnf_transformation,[status(esa)],[f92]) ).
fof(f193,plain,
p_Rd(t_139),
inference(cnf_transformation,[status(esa)],[f93]) ).
fof(f194,plain,
~ p_Reset(t_139),
inference(cnf_transformation,[status(esa)],[f94]) ).
fof(f195,plain,
~ p_Empty(plus(t_139,n1)),
inference(cnf_transformation,[status(esa)],[f95]) ).
fof(f197,plain,
! [X0,X1] :
( minus(plus(X0,X1),X1) = X0
| def_10(X1,plus(X0,X1)) ),
inference(destructive_equality_resolution,[status(esa)],[f102]) ).
fof(f198,plain,
! [X0] : ~ def_10(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f104]) ).
fof(f201,plain,
! [X0] :
( level(X0) != n0
| p_Empty(X0) ),
inference(forward_demodulation,[status(thm)],[f119,f122]) ).
fof(f255,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| ~ p_Rd(X0)
| ~ gt(level(X0),n0)
| int_level(plus(X0,n1)) = minus(int_level(X0),n1) ),
inference(forward_demodulation,[status(thm)],[f119,f171]) ).
fof(f256,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| ~ p_Rd(X0)
| ~ gt(level(X0),n0)
| level(plus(X0,n1)) = minus(int_level(X0),n1) ),
inference(forward_demodulation,[status(thm)],[f119,f255]) ).
fof(f257,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| ~ p_Rd(X0)
| ~ gt(level(X0),n0)
| level(plus(X0,n1)) = minus(level(X0),n1) ),
inference(forward_demodulation,[status(thm)],[f119,f256]) ).
fof(f322,plain,
( spl0_2
<=> p_Reset(t_139) ),
introduced(split_symbol_definition) ).
fof(f323,plain,
( p_Reset(t_139)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f322]) ).
fof(f325,plain,
( spl0_3
<=> p_Wr(t_139) ),
introduced(split_symbol_definition) ).
fof(f326,plain,
( p_Wr(t_139)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f325]) ).
fof(f328,plain,
( spl0_4
<=> p_Rd(t_139) ),
introduced(split_symbol_definition) ).
fof(f330,plain,
( ~ p_Rd(t_139)
| spl0_4 ),
inference(component_clause,[status(thm)],[f328]) ).
fof(f344,plain,
( spl0_8
<=> gt(n1,n0) ),
introduced(split_symbol_definition) ).
fof(f346,plain,
( ~ gt(n1,n0)
| spl0_8 ),
inference(component_clause,[status(thm)],[f344]) ).
fof(f347,plain,
( spl0_9
<=> level(plus(t_139,n1)) = minus(level(t_139),n1) ),
introduced(split_symbol_definition) ).
fof(f348,plain,
( level(plus(t_139,n1)) = minus(level(t_139),n1)
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f347]) ).
fof(f350,plain,
( p_Reset(t_139)
| p_Wr(t_139)
| ~ p_Rd(t_139)
| ~ gt(n1,n0)
| level(plus(t_139,n1)) = minus(level(t_139),n1) ),
inference(paramodulation,[status(thm)],[f191,f257]) ).
fof(f351,plain,
( spl0_2
| spl0_3
| ~ spl0_4
| ~ spl0_8
| spl0_9 ),
inference(split_clause,[status(thm)],[f350,f322,f325,f328,f344,f347]) ).
fof(f352,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f323,f194]) ).
fof(f353,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f352]) ).
fof(f442,plain,
! [X0] :
( minus(plus(n0,X0),X0) = n0
| def_10(X0,X0) ),
inference(paramodulation,[status(thm)],[f117,f197]) ).
fof(f443,plain,
! [X0] :
( minus(X0,X0) = n0
| def_10(X0,X0) ),
inference(forward_demodulation,[status(thm)],[f117,f442]) ).
fof(f444,plain,
! [X0] : minus(X0,X0) = n0,
inference(forward_subsumption_resolution,[status(thm)],[f443,f198]) ).
fof(f449,plain,
gt(n1,n0),
inference(paramodulation,[status(thm)],[f117,f97]) ).
fof(f450,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f449,f346]) ).
fof(f451,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f450]) ).
fof(f461,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f330,f193]) ).
fof(f462,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f461]) ).
fof(f466,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f326,f192]) ).
fof(f467,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f466]) ).
fof(f469,plain,
( level(plus(t_139,n1)) = minus(n1,n1)
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f191,f348]) ).
fof(f470,plain,
( level(plus(t_139,n1)) = n0
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f444,f469]) ).
fof(f476,plain,
( p_Empty(plus(t_139,n1))
| ~ spl0_9 ),
inference(resolution,[status(thm)],[f470,f201]) ).
fof(f477,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f476,f195]) ).
fof(f478,plain,
~ spl0_9,
inference(contradiction_clause,[status(thm)],[f477]) ).
fof(f479,plain,
$false,
inference(sat_refutation,[status(thm)],[f351,f353,f451,f462,f467,f478]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.27 % Problem : HWV023-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.28 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.49 % Computer : n018.cluster.edu
% 0.13/0.49 % Model : x86_64 x86_64
% 0.13/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.49 % Memory : 8042.1875MB
% 0.13/0.49 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.49 % CPULimit : 300
% 0.13/0.49 % WCLimit : 300
% 0.13/0.49 % DateTime : Tue May 30 11:57:26 EDT 2023
% 0.13/0.50 % CPUTime :
% 0.13/0.51 % Drodi V3.5.1
% 0.21/0.53 % Refutation found
% 0.21/0.53 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.21/0.53 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.55 % Elapsed time: 0.044189 seconds
% 0.21/0.55 % CPU time: 0.185025 seconds
% 0.21/0.55 % Memory used: 22.144 MB
%------------------------------------------------------------------------------