TSTP Solution File: HWV027-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : HWV027-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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:13:00 EDT 2023
% Result : Unsatisfiable 0.07s 0.27s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 54 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 17 ~; 22 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X_t_32] : level(X_t_32) = int_level(X_t_32),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f82,axiom,
! [X_t_42] :
( p_Reset(X_t_42)
| p_Wr(X_t_42)
| p_Rd(X_t_42)
| int_level(plus(X_t_42,n1)) = int_level(X_t_42) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f91,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f92,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f93,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f94,negated_conjecture,
level(t_139) != level(plus(t_139,n1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f118,plain,
! [X0] : level(X0) = int_level(X0),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f181,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| p_Rd(X0)
| int_level(plus(X0,n1)) = int_level(X0) ),
inference(cnf_transformation,[status(esa)],[f82]) ).
fof(f190,plain,
~ p_Wr(t_139),
inference(cnf_transformation,[status(esa)],[f91]) ).
fof(f191,plain,
~ p_Rd(t_139),
inference(cnf_transformation,[status(esa)],[f92]) ).
fof(f192,plain,
~ p_Reset(t_139),
inference(cnf_transformation,[status(esa)],[f93]) ).
fof(f193,plain,
level(t_139) != level(plus(t_139,n1)),
inference(cnf_transformation,[status(esa)],[f94]) ).
fof(f197,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| p_Rd(X0)
| level(plus(X0,n1)) = int_level(X0) ),
inference(forward_demodulation,[status(thm)],[f118,f181]) ).
fof(f198,plain,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| p_Rd(X0)
| level(plus(X0,n1)) = level(X0) ),
inference(forward_demodulation,[status(thm)],[f118,f197]) ).
fof(f199,plain,
( spl0_0
<=> p_Reset(t_139) ),
introduced(split_symbol_definition) ).
fof(f200,plain,
( p_Reset(t_139)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f199]) ).
fof(f202,plain,
( spl0_1
<=> p_Wr(t_139) ),
introduced(split_symbol_definition) ).
fof(f203,plain,
( p_Wr(t_139)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f202]) ).
fof(f205,plain,
( spl0_2
<=> p_Rd(t_139) ),
introduced(split_symbol_definition) ).
fof(f206,plain,
( p_Rd(t_139)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f205]) ).
fof(f208,plain,
( p_Reset(t_139)
| p_Wr(t_139)
| p_Rd(t_139) ),
inference(resolution,[status(thm)],[f198,f193]) ).
fof(f209,plain,
( spl0_0
| spl0_1
| spl0_2 ),
inference(split_clause,[status(thm)],[f208,f199,f202,f205]) ).
fof(f217,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f206,f191]) ).
fof(f218,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f217]) ).
fof(f219,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f200,f192]) ).
fof(f220,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f219]) ).
fof(f221,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f203,f190]) ).
fof(f222,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f221]) ).
fof(f223,plain,
$false,
inference(sat_refutation,[status(thm)],[f209,f218,f220,f222]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : HWV027-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.25 % Computer : n008.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Tue May 30 11:55:24 EDT 2023
% 0.07/0.25 % CPUTime :
% 0.07/0.26 % Drodi V3.5.1
% 0.07/0.27 % Refutation found
% 0.07/0.27 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.07/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.27 % Elapsed time: 0.014745 seconds
% 0.07/0.27 % CPU time: 0.021196 seconds
% 0.07/0.27 % Memory used: 15.064 MB
%------------------------------------------------------------------------------