TSTP Solution File: NUM024-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.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:24:21 EDT 2023
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 48 (; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A] : equalish(add(A,n0),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [A,B] :
( ~ less(A,B)
| equalish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X,Y] :
( ~ equalish(X,Y)
| equalish(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [X,Y,Z] :
( ~ equalish(X,Y)
| ~ equalish(Y,Z)
| equalish(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [A,B,C] :
( ~ equalish(add(A,B),add(C,B))
| equalish(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [A,B] : equalish(add(A,B),add(B,A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,hypothesis,
less(a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
! [A] : ~ equalish(successor(A),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,plain,
! [X0] : equalish(add(X0,n0),X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f27,plain,
! [X0,X1] :
( ~ less(X0,X1)
| equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f29,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f30,plain,
! [X,Z] :
( ! [Y] :
( ~ equalish(X,Y)
| ~ equalish(Y,Z) )
| equalish(X,Z) ),
inference(miniscoping,[status(esa)],[f12]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ~ equalish(X0,X1)
| ~ equalish(X1,X2)
| equalish(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f32,plain,
! [A,C] :
( ! [B] : ~ equalish(add(A,B),add(C,B))
| equalish(A,C) ),
inference(miniscoping,[status(esa)],[f13]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ equalish(add(X0,X1),add(X2,X1))
| equalish(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f32]) ).
fof(f34,plain,
! [X0,X1] : equalish(add(X0,X1),add(X1,X0)),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f35,plain,
less(a,a),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f36,plain,
! [X0] : ~ equalish(successor(X0),n0),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f37,plain,
! [X0] : ~ equalish(n0,successor(X0)),
inference(resolution,[status(thm)],[f29,f36]) ).
fof(f89,plain,
! [X0,X1,X2,X3] :
( equalish(X0,X1)
| ~ equalish(add(X0,X2),X3)
| ~ equalish(X3,add(X1,X2)) ),
inference(resolution,[status(thm)],[f33,f31]) ).
fof(f276,plain,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X0,add(X1,n0)) ),
inference(resolution,[status(thm)],[f89,f17]) ).
fof(f290,plain,
! [X0] : equalish(add(n0,X0),X0),
inference(resolution,[status(thm)],[f276,f34]) ).
fof(f296,plain,
! [X0,X1] :
( equalish(n0,X0)
| ~ equalish(X1,add(X0,X1)) ),
inference(resolution,[status(thm)],[f290,f89]) ).
fof(f333,plain,
! [X0,X1] :
( equalish(n0,X0)
| ~ equalish(add(X0,X1),X1) ),
inference(resolution,[status(thm)],[f296,f29]) ).
fof(f376,plain,
! [X0] :
( equalish(n0,successor(predecessor_of_1st_minus_2nd(X0,X0)))
| ~ less(X0,X0) ),
inference(resolution,[status(thm)],[f333,f27]) ).
fof(f377,plain,
! [X0] : ~ less(X0,X0),
inference(forward_subsumption_resolution,[status(thm)],[f376,f37]) ).
fof(f381,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f35,f377]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 30 10:02:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.20/0.47 % Refutation found
% 0.20/0.47 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.20/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.49 % Elapsed time: 0.139252 seconds
% 0.20/0.49 % CPU time: 0.929439 seconds
% 0.20/0.49 % Memory used: 42.706 MB
%------------------------------------------------------------------------------