TSTP Solution File: NUM023-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM023-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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 : Tue Apr 30 20:30:13 EDT 2024
% Result : Unsatisfiable 0.06s 0.27s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 6 unt; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : equalish(add(A,n0),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [A,B,C] :
( ~ equalish(add(successor(A),B),C)
| less(B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
~ less(n0,successor(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,plain,
! [X0] : equalish(add(X0,n0),X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f24,plain,
! [B,C] :
( ! [A] : ~ equalish(add(successor(A),B),C)
| less(B,C) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ~ equalish(add(successor(X0),X1),X2)
| less(X1,X2) ),
inference(cnf_transformation,[status(esa)],[f24]) ).
fof(f33,plain,
~ less(n0,successor(a)),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f107,plain,
! [X0] : less(n0,successor(X0)),
inference(resolution,[status(thm)],[f25,f16]) ).
fof(f111,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f33,f107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : NUM023-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26 % Computer : n003.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Mon Apr 29 20:49:48 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.06/0.27 % Drodi V3.6.0
% 0.06/0.27 % Refutation found
% 0.06/0.27 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.06/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.28 % Elapsed time: 0.012466 seconds
% 0.11/0.28 % CPU time: 0.018477 seconds
% 0.11/0.28 % Total memory used: 6.705 MB
% 0.11/0.28 % Net memory used: 6.666 MB
%------------------------------------------------------------------------------