TSTP Solution File: NUM024-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% 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 : 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.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 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 : 46 ( 46 !; 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(f83,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(f114,plain,
equalish(add(successor(predecessor_of_1st_minus_2nd(a,a)),a),a),
inference(resolution,[status(thm)],[f27,f35]) ).
fof(f118,plain,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X0,add(X1,n0)) ),
inference(resolution,[status(thm)],[f83,f17]) ).
fof(f148,plain,
! [X0] : equalish(add(n0,X0),X0),
inference(resolution,[status(thm)],[f118,f34]) ).
fof(f153,plain,
! [X0,X1] :
( equalish(n0,X0)
| ~ equalish(X1,add(X0,X1)) ),
inference(resolution,[status(thm)],[f148,f83]) ).
fof(f179,plain,
! [X0,X1] :
( equalish(n0,X0)
| ~ equalish(add(X0,X1),X1) ),
inference(resolution,[status(thm)],[f153,f29]) ).
fof(f318,plain,
equalish(n0,successor(predecessor_of_1st_minus_2nd(a,a))),
inference(resolution,[status(thm)],[f114,f179]) ).
fof(f319,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f318,f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.33 % Computer : n003.cluster.edu
% 0.09/0.33 % Model : x86_64 x86_64
% 0.09/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33 % Memory : 8042.1875MB
% 0.09/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.33 % CPULimit : 300
% 0.09/0.33 % WCLimit : 300
% 0.09/0.33 % DateTime : Mon Apr 29 20:51:03 EDT 2024
% 0.09/0.33 % CPUTime :
% 0.09/0.34 % Drodi V3.6.0
% 0.09/0.39 % Refutation found
% 0.09/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.40 % Elapsed time: 0.052364 seconds
% 0.09/0.40 % CPU time: 0.303431 seconds
% 0.09/0.40 % Total memory used: 38.766 MB
% 0.09/0.40 % Net memory used: 37.727 MB
%------------------------------------------------------------------------------