TSTP Solution File: HWV025-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : HWV025-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 67 ( 12 unt; 0 def)
% Number of atoms : 162 ( 24 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 155 ( 60 ~; 87 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,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(f18,axiom,
! [X_29,Y_30] :
( plus(X_29,n1) != plus(Y_30,n1)
| X_29 = Y_30 ),
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(f30,axiom,
! [X_t_37] :
( ~ p_Reset(X_t_37)
| ~ p_Rd_error(plus(X_t_37,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f49,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| ~ p_Wr(X_t_42)
| p_Rd(X_t_42)
| ~ p_Rd_error(plus(X_t_42,n1))
| p_Rd_error(X_t_42) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f50,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| ~ p_Wr(X_t_42)
| p_Rd(X_t_42)
| p_Rd_error(plus(X_t_42,n1))
| ~ p_Rd_error(X_t_42) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f85,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| p_Rd(X_t_42)
| ~ p_Rd_error(plus(X_t_42,n1))
| p_Rd_error(X_t_42) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f86,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| p_Rd(X_t_42)
| p_Rd_error(plus(X_t_42,n1))
| ~ p_Rd_error(X_t_42) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f91,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f92,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f93,negated_conjecture,
( ~ p_Rd_error(t_139)
| ~ p_Rd_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f94,negated_conjecture,
( p_Rd_error(t_139)
| p_Rd_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f98,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)],[f4]) ).
fof(f99,plain,
! [X0,X1,X2] :
( minus(X0,X1) != X2
| plus(X2,X1) = X0
| def_10(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f98]) ).
fof(f103,plain,
! [X0,X1] :
( ~ def_10(X0,X1)
| X1 != X0 ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f115,plain,
! [X0,X1] :
( plus(X0,n1) != plus(X1,n1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f116,plain,
! [X0] : plus(n0,X0) = X0,
inference(cnf_transformation,[status(esa)],[f19]) ).
fof(f127,plain,
! [X0] :
( ~ p_Reset(X0)
| ~ p_Rd_error(plus(X0,n1)) ),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f148,plain,
! [X0] :
( p_Reset(X0)
| ~ p_Wr(X0)
| p_Rd(X0)
| ~ p_Rd_error(plus(X0,n1))
| p_Rd_error(X0) ),
inference(cnf_transformation,[status(esa)],[f49]) ).
fof(f149,plain,
! [X0] :
( p_Reset(X0)
| ~ p_Wr(X0)
| p_Rd(X0)
| p_Rd_error(plus(X0,n1))
| ~ p_Rd_error(X0) ),
inference(cnf_transformation,[status(esa)],[f50]) ).
fof(f184,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| p_Rd(X0)
| ~ p_Rd_error(plus(X0,n1))
| p_Rd_error(X0) ),
inference(cnf_transformation,[status(esa)],[f85]) ).
fof(f185,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| p_Rd(X0)
| p_Rd_error(plus(X0,n1))
| ~ p_Rd_error(X0) ),
inference(cnf_transformation,[status(esa)],[f86]) ).
fof(f190,plain,
~ p_Rd(t_139),
inference(cnf_transformation,[status(esa)],[f91]) ).
fof(f191,plain,
~ p_Reset(t_139),
inference(cnf_transformation,[status(esa)],[f92]) ).
fof(f192,plain,
( ~ p_Rd_error(t_139)
| ~ p_Rd_error(plus(t_139,n1)) ),
inference(cnf_transformation,[status(esa)],[f93]) ).
fof(f193,plain,
( p_Rd_error(t_139)
| p_Rd_error(plus(t_139,n1)) ),
inference(cnf_transformation,[status(esa)],[f94]) ).
fof(f194,plain,
( spl0_0
<=> p_Rd_error(t_139) ),
introduced(split_symbol_definition) ).
fof(f197,plain,
( spl0_1
<=> p_Rd_error(plus(t_139,n1)) ),
introduced(split_symbol_definition) ).
fof(f198,plain,
( p_Rd_error(plus(t_139,n1))
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f197]) ).
fof(f199,plain,
( ~ p_Rd_error(plus(t_139,n1))
| spl0_1 ),
inference(component_clause,[status(thm)],[f197]) ).
fof(f200,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f192,f194,f197]) ).
fof(f201,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f193,f194,f197]) ).
fof(f202,plain,
! [X0,X1] :
( plus(minus(X0,X1),X1) = X0
| def_10(X1,X0) ),
inference(destructive_equality_resolution,[status(esa)],[f99]) ).
fof(f204,plain,
! [X0] : ~ def_10(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f103]) ).
fof(f205,plain,
! [X0] :
( ~ p_Wr(X0)
| p_Rd(X0)
| ~ p_Rd_error(plus(X0,n1))
| p_Rd_error(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f148,f127]) ).
fof(f206,plain,
! [X0] :
( p_Wr(X0)
| p_Rd(X0)
| ~ p_Rd_error(plus(X0,n1))
| p_Rd_error(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f184,f127]) ).
fof(f207,plain,
! [X0] :
( p_Rd(X0)
| ~ p_Rd_error(plus(X0,n1))
| p_Rd_error(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[f205,f206]) ).
fof(f208,plain,
! [X0] :
( p_Reset(X0)
| p_Rd(X0)
| p_Rd_error(plus(X0,n1))
| ~ p_Rd_error(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f185,f149]) ).
fof(f246,plain,
! [X0] :
( plus(X0,n1) != n1
| X0 = n0 ),
inference(paramodulation,[status(thm)],[f116,f115]) ).
fof(f263,plain,
( spl0_10
<=> n1 = n1 ),
introduced(split_symbol_definition) ).
fof(f265,plain,
( n1 != n1
| spl0_10 ),
inference(component_clause,[status(thm)],[f263]) ).
fof(f266,plain,
( spl0_11
<=> n0 = n0 ),
introduced(split_symbol_definition) ).
fof(f269,plain,
( n1 != n1
| n0 = n0 ),
inference(paramodulation,[status(thm)],[f116,f246]) ).
fof(f270,plain,
( ~ spl0_10
| spl0_11 ),
inference(split_clause,[status(thm)],[f269,f263,f266]) ).
fof(f271,plain,
( $false
| spl0_10 ),
inference(trivial_equality_resolution,[status(esa)],[f265]) ).
fof(f272,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f271]) ).
fof(f273,plain,
( spl0_12
<=> def_10(n1,n1) ),
introduced(split_symbol_definition) ).
fof(f274,plain,
( def_10(n1,n1)
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f273]) ).
fof(f276,plain,
( spl0_13
<=> minus(n1,n1) = n0 ),
introduced(split_symbol_definition) ).
fof(f279,plain,
( def_10(n1,n1)
| minus(n1,n1) = n0 ),
inference(resolution,[status(thm)],[f202,f246]) ).
fof(f280,plain,
( spl0_12
| spl0_13 ),
inference(split_clause,[status(thm)],[f279,f273,f276]) ).
fof(f298,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f274,f204]) ).
fof(f299,plain,
~ spl0_12,
inference(contradiction_clause,[status(thm)],[f298]) ).
fof(f305,plain,
( spl0_14
<=> p_Rd(t_139) ),
introduced(split_symbol_definition) ).
fof(f306,plain,
( p_Rd(t_139)
| ~ spl0_14 ),
inference(component_clause,[status(thm)],[f305]) ).
fof(f308,plain,
( p_Rd(t_139)
| p_Rd_error(t_139)
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f198,f207]) ).
fof(f309,plain,
( spl0_14
| spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f308,f305,f194,f197]) ).
fof(f311,plain,
( $false
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f306,f190]) ).
fof(f312,plain,
~ spl0_14,
inference(contradiction_clause,[status(thm)],[f311]) ).
fof(f313,plain,
( spl0_15
<=> p_Reset(t_139) ),
introduced(split_symbol_definition) ).
fof(f314,plain,
( p_Reset(t_139)
| ~ spl0_15 ),
inference(component_clause,[status(thm)],[f313]) ).
fof(f316,plain,
( p_Reset(t_139)
| p_Rd(t_139)
| ~ p_Rd_error(t_139)
| spl0_1 ),
inference(resolution,[status(thm)],[f199,f208]) ).
fof(f317,plain,
( spl0_15
| spl0_14
| ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f316,f313,f305,f194,f197]) ).
fof(f318,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f314,f191]) ).
fof(f319,plain,
~ spl0_15,
inference(contradiction_clause,[status(thm)],[f318]) ).
fof(f320,plain,
$false,
inference(sat_refutation,[status(thm)],[f200,f201,f270,f272,f280,f299,f309,f312,f317,f319]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : HWV025-1 : TPTP v8.1.2. Released v2.5.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 12:15:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37 % Elapsed time: 0.027215 seconds
% 0.13/0.37 % CPU time: 0.040565 seconds
% 0.13/0.37 % Memory used: 13.286 MB
%------------------------------------------------------------------------------