TSTP Solution File: NUM015-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : NUM015-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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:11 EDT 2024
% Result : Unsatisfiable 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 44 ( 4 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 95 ( 41 ~; 49 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 25 ( 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : divides(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X,Y,Z] :
( ~ divides(X,Y)
| ~ divides(Y,Z)
| divides(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] :
( prime(X)
| divides(divisor(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] :
( prime(X)
| less(n1,divisor(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X] :
( prime(X)
| less(divisor(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] :
( ~ less(n1,X)
| ~ less(X,a)
| prime(factor_of(X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X] :
( ~ less(n1,X)
| ~ less(X,a)
| divides(factor_of(X),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
! [X] :
( ~ prime(X)
| ~ divides(X,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,plain,
! [X0] : divides(X0,X0),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f11,plain,
! [X,Z] :
( ! [Y] :
( ~ divides(X,Y)
| ~ divides(Y,Z) )
| divides(X,Z) ),
inference(miniscoping,[status(esa)],[f2]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ~ divides(X0,X1)
| ~ divides(X1,X2)
| divides(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f13,plain,
! [X0] :
( prime(X0)
| divides(divisor(X0),X0) ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f14,plain,
! [X0] :
( prime(X0)
| less(n1,divisor(X0)) ),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f15,plain,
! [X0] :
( prime(X0)
| less(divisor(X0),X0) ),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f16,plain,
! [X0] :
( ~ less(n1,X0)
| ~ less(X0,a)
| prime(factor_of(X0)) ),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f17,plain,
! [X0] :
( ~ less(n1,X0)
| ~ less(X0,a)
| divides(factor_of(X0),X0) ),
inference(cnf_transformation,[status(esa)],[f7]) ).
fof(f19,plain,
! [X0] :
( ~ prime(X0)
| ~ divides(X0,a) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f20,plain,
! [X0] :
( ~ less(divisor(X0),a)
| prime(factor_of(divisor(X0)))
| prime(X0) ),
inference(resolution,[status(thm)],[f16,f14]) ).
fof(f29,plain,
( spl0_2
<=> prime(factor_of(divisor(a))) ),
introduced(split_symbol_definition) ).
fof(f30,plain,
( prime(factor_of(divisor(a)))
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f29]) ).
fof(f32,plain,
( spl0_3
<=> prime(a) ),
introduced(split_symbol_definition) ).
fof(f33,plain,
( prime(a)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f32]) ).
fof(f35,plain,
( prime(factor_of(divisor(a)))
| prime(a)
| prime(a) ),
inference(resolution,[status(thm)],[f20,f15]) ).
fof(f36,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f35,f29,f32]) ).
fof(f37,plain,
( ~ divides(factor_of(divisor(a)),a)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f30,f19]) ).
fof(f38,plain,
! [X0] :
( ~ divides(factor_of(divisor(a)),X0)
| ~ divides(X0,a)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f37,f12]) ).
fof(f39,plain,
( spl0_4
<=> divides(divisor(a),a) ),
introduced(split_symbol_definition) ).
fof(f41,plain,
( ~ divides(divisor(a),a)
| spl0_4 ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( spl0_5
<=> less(n1,divisor(a)) ),
introduced(split_symbol_definition) ).
fof(f44,plain,
( ~ less(n1,divisor(a))
| spl0_5 ),
inference(component_clause,[status(thm)],[f42]) ).
fof(f45,plain,
( spl0_6
<=> less(divisor(a),a) ),
introduced(split_symbol_definition) ).
fof(f47,plain,
( ~ less(divisor(a),a)
| spl0_6 ),
inference(component_clause,[status(thm)],[f45]) ).
fof(f48,plain,
( ~ divides(divisor(a),a)
| ~ less(n1,divisor(a))
| ~ less(divisor(a),a)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f38,f17]) ).
fof(f49,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f48,f39,f42,f45,f29]) ).
fof(f52,plain,
( ~ divides(a,a)
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f33,f19]) ).
fof(f53,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f52,f10]) ).
fof(f54,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f53]) ).
fof(f55,plain,
( prime(a)
| spl0_6 ),
inference(resolution,[status(thm)],[f47,f15]) ).
fof(f56,plain,
( spl0_3
| spl0_6 ),
inference(split_clause,[status(thm)],[f55,f32,f45]) ).
fof(f62,plain,
( prime(a)
| spl0_4 ),
inference(resolution,[status(thm)],[f41,f13]) ).
fof(f63,plain,
( spl0_3
| spl0_4 ),
inference(split_clause,[status(thm)],[f62,f32,f39]) ).
fof(f65,plain,
( prime(a)
| spl0_5 ),
inference(resolution,[status(thm)],[f44,f14]) ).
fof(f66,plain,
( spl0_3
| spl0_5 ),
inference(split_clause,[status(thm)],[f65,f32,f42]) ).
fof(f67,plain,
$false,
inference(sat_refutation,[status(thm)],[f36,f49,f54,f56,f63,f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM015-1 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Apr 29 20:39:04 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % Drodi V3.6.0
% 0.11/0.34 % Refutation found
% 0.11/0.34 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.11/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.36 % Elapsed time: 0.017478 seconds
% 0.11/0.36 % CPU time: 0.033304 seconds
% 0.11/0.36 % Total memory used: 2.324 MB
% 0.11/0.36 % Net memory used: 2.286 MB
%------------------------------------------------------------------------------