TSTP Solution File: NUM343+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM343+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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:24:54 EDT 2023
% Result : Theorem 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 32 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 14 ~; 7 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 (; 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f284,axiom,
! [X,Y] :
( less(X,Y)
<=> ( ~ less(Y,X)
& Y != X ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f402,conjecture,
? [X] :
( ( less(nn1,X)
& less(X,n1) )
=> sum(n21,X,n21) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f403,negated_conjecture,
~ ? [X] :
( ( less(nn1,X)
& less(X,n1) )
=> sum(n21,X,n21) ),
inference(negated_conjecture,[status(cth)],[f402]) ).
fof(f703,plain,
! [X,Y] :
( ( ~ less(X,Y)
| ( ~ less(Y,X)
& Y != X ) )
& ( less(X,Y)
| less(Y,X)
| Y = X ) ),
inference(NNF_transformation,[status(esa)],[f284]) ).
fof(f704,plain,
( ! [X,Y] :
( ~ less(X,Y)
| ( ~ less(Y,X)
& Y != X ) )
& ! [X,Y] :
( less(X,Y)
| less(Y,X)
| Y = X ) ),
inference(miniscoping,[status(esa)],[f703]) ).
fof(f706,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X1 != X0 ),
inference(cnf_transformation,[status(esa)],[f704]) ).
fof(f861,plain,
! [X] :
( less(nn1,X)
& less(X,n1)
& ~ sum(n21,X,n21) ),
inference(pre_NNF_transformation,[status(esa)],[f403]) ).
fof(f862,plain,
( ! [X] : less(nn1,X)
& ! [X] : less(X,n1)
& ! [X] : ~ sum(n21,X,n21) ),
inference(miniscoping,[status(esa)],[f861]) ).
fof(f863,plain,
! [X0] : less(nn1,X0),
inference(cnf_transformation,[status(esa)],[f862]) ).
fof(f866,plain,
! [X0] : ~ less(X0,X0),
inference(destructive_equality_resolution,[status(esa)],[f706]) ).
fof(f868,plain,
$false,
inference(resolution,[status(thm)],[f866,f863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM343+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue May 30 09:43:07 EDT 2023
% 0.18/0.34 % CPUTime :
% 0.18/0.35 % Drodi V3.5.1
% 0.18/0.36 % Refutation found
% 0.18/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/0.57 % Elapsed time: 0.020479 seconds
% 0.22/0.57 % CPU time: 0.040329 seconds
% 0.22/0.57 % Memory used: 15.406 MB
%------------------------------------------------------------------------------