TSTP Solution File: SWV151+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV151+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n026.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:40:47 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 70 ( 10 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 60 ( 25 ~; 20 |; 8 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 27 (; 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
! [A] :
( ( leq(n0,A)
& leq(A,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ! [A] :
( ( leq(n0,A)
& leq(A,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f58,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f78,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n0) )
=> X = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f91,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f93,plain,
! [X,Y,Z] :
( ~ leq(X,Y)
| ~ leq(Y,Z)
| leq(X,Z) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f94,plain,
! [X,Z] :
( ! [Y] :
( ~ leq(X,Y)
| ~ leq(Y,Z) )
| leq(X,Z) ),
inference(miniscoping,[status(esa)],[f93]) ).
fof(f95,plain,
! [X0,X1,X2] :
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f94]) ).
fof(f104,plain,
! [X,Y] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f105,plain,
! [X0,X1] :
( ~ gt(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f104]) ).
fof(f244,plain,
? [A] :
( leq(n0,A)
& leq(A,tptp_minus_1)
& sum(n0,n4,a_select3(q,A,tptp_sum_index)) != n1 ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
( leq(n0,sk0_23)
& leq(sk0_23,tptp_minus_1)
& sum(n0,n4,a_select3(q,sk0_23,tptp_sum_index)) != n1 ),
inference(skolemization,[status(esa)],[f244]) ).
fof(f246,plain,
leq(n0,sk0_23),
inference(cnf_transformation,[status(esa)],[f245]) ).
fof(f247,plain,
leq(sk0_23,tptp_minus_1),
inference(cnf_transformation,[status(esa)],[f245]) ).
fof(f252,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[status(esa)],[f58]) ).
fof(f274,plain,
! [X] :
( ~ leq(n0,X)
| ~ leq(X,n0)
| X = n0 ),
inference(pre_NNF_transformation,[status(esa)],[f78]) ).
fof(f275,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n0)
| X0 = n0 ),
inference(cnf_transformation,[status(esa)],[f274]) ).
fof(f316,plain,
! [X0] :
( ~ leq(X0,sk0_23)
| leq(X0,tptp_minus_1) ),
inference(resolution,[status(thm)],[f95,f247]) ).
fof(f343,plain,
leq(n0,tptp_minus_1),
inference(resolution,[status(thm)],[f316,f246]) ).
fof(f353,plain,
( spl0_1
<=> tptp_minus_1 = n0 ),
introduced(split_symbol_definition) ).
fof(f354,plain,
( tptp_minus_1 = n0
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f353]) ).
fof(f428,plain,
( spl0_18
<=> leq(tptp_minus_1,n0) ),
introduced(split_symbol_definition) ).
fof(f430,plain,
( ~ leq(tptp_minus_1,n0)
| spl0_18 ),
inference(component_clause,[status(thm)],[f428]) ).
fof(f431,plain,
( ~ leq(tptp_minus_1,n0)
| tptp_minus_1 = n0 ),
inference(resolution,[status(thm)],[f275,f343]) ).
fof(f432,plain,
( ~ spl0_18
| spl0_1 ),
inference(split_clause,[status(thm)],[f431,f428,f353]) ).
fof(f790,plain,
leq(tptp_minus_1,n0),
inference(resolution,[status(thm)],[f105,f252]) ).
fof(f791,plain,
( $false
| spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f790,f430]) ).
fof(f792,plain,
spl0_18,
inference(contradiction_clause,[status(thm)],[f791]) ).
fof(f837,plain,
( gt(n0,n0)
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f354,f252]) ).
fof(f838,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f837,f91]) ).
fof(f839,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f838]) ).
fof(f840,plain,
$false,
inference(sat_refutation,[status(thm)],[f432,f792,f839]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV151+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.04/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n026.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 11:56:43 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.37 % Elapsed time: 0.031582 seconds
% 0.20/0.37 % CPU time: 0.070455 seconds
% 0.20/0.37 % Memory used: 19.917 MB
%------------------------------------------------------------------------------