%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV142+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:46:44 PM UTC 2026
% Result : Theorem 0.08s 0.41s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 6 unt; 4 def)
% Number of atoms : 152 ( 6 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 163 ( 47 ~; 42 |; 42 &)
% ( 4 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X,Y,Z] :
( ( gt(Y,Z)
& gt(X,Y) )
=> gt(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y] :
( ( X != Y
& leq(X,Y) )
=> gt(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_best7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_best7,n3) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f64,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f88,plain,
! [X,Y,Z] :
( gt(X,Z)
| ~ gt(Y,Z)
| ~ gt(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f89,plain,
! [X,Z] :
( gt(X,Z)
| ! [Y] :
( ~ gt(Y,Z)
| ~ gt(X,Y) ) ),
inference(miniscoping,[status(thm)],[f88]) ).
fof(f90,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X1,X2)
| ~ gt(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f89]) ).
fof(f106,plain,
! [X,Y] :
( gt(Y,X)
| X = Y
| ~ leq(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f9]) ).
fof(f107,plain,
! [X0,X1] :
( gt(X1,X0)
| X0 = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f106]) ).
fof(f244,plain,
( ~ leq(s_best7,n3)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f246,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f256,plain,
( leq(s_best7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f259,plain,
~ leq(s_best7,n3),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f269,plain,
gt(n1,n0),
inference(cnf_transformation,[status(thm)],[f64]) ).
fof(f349,definition,
( sQ4_spl
<=> leq(s_best7,n3) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f350,plain,
( ~ sQ4_spl
| leq(s_best7,n3) ),
inference(component_clause,[status(thm)],[f349]) ).
fof(f361,definition,
( sQ7_spl
<=> gt(loopcounter,n0) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f363,plain,
( sQ7_spl
| ~ gt(loopcounter,n0) ),
inference(component_clause,[status(thm)],[f361]) ).
fof(f367,plain,
( sQ4_spl
| ~ sQ7_spl ),
inference(split_clause,[status(thm)],[f256,f361,f349]) ).
fof(f383,plain,
! [X0] :
( sQ7_spl
| ~ gt(X0,n0)
| ~ gt(loopcounter,X0) ),
inference(resolution,[status(thm)],[f90,f363]) ).
fof(f463,plain,
( gt(loopcounter,n1)
| n1 = loopcounter ),
inference(resolution,[status(thm)],[f107,f246]) ).
fof(f468,definition,
( sQ20_spl
<=> n1 = loopcounter ),
introduced(definition,[new_symbols(definition,[sQ20_spl])],[split_symbol_definition]) ).
fof(f469,plain,
( ~ sQ20_spl
| n1 = loopcounter ),
inference(component_clause,[status(thm)],[f468]) ).
fof(f471,definition,
( sQ21_spl
<=> gt(loopcounter,n1) ),
introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).
fof(f472,plain,
( ~ sQ21_spl
| gt(loopcounter,n1) ),
inference(component_clause,[status(thm)],[f471]) ).
fof(f474,plain,
( sQ21_spl
| sQ20_spl ),
inference(split_clause,[status(thm)],[f463,f468,f471]) ).
fof(f492,plain,
( ~ sQ20_spl
| gt(loopcounter,n0) ),
inference(backward_demodulation,[status(thm)],[f469,f269]) ).
fof(f494,plain,
( ~ sQ20_spl
| sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f492,f363]) ).
fof(f495,plain,
( ~ sQ20_spl
| sQ7_spl ),
inference(contradiction_clause,[status(thm)],[f494]) ).
fof(f496,plain,
( ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f350,f259]) ).
fof(f497,plain,
~ sQ4_spl,
inference(contradiction_clause,[status(thm)],[f496]) ).
fof(f683,plain,
( ~ sQ21_spl
| sQ7_spl
| ~ gt(n1,n0) ),
inference(resolution,[status(thm)],[f383,f472]) ).
fof(f687,plain,
( ~ sQ21_spl
| sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f683,f269]) ).
fof(f688,plain,
( ~ sQ21_spl
| sQ7_spl ),
inference(contradiction_clause,[status(thm)],[f687]) ).
fof(f689,plain,
$false,
inference(sat_refutation,[status(thm)],[f367,f474,f495,f497,f688]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV142+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n007.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 08:31:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.38 % Drodi V4.1.1
% 0.08/0.41 % Refutation found
% 0.08/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.44 % Elapsed time: 0.071872 seconds
% 0.08/0.44 % CPU time: 0.181911 seconds
% 0.08/0.44 % Total memory used: 109.348 MB
% 0.08/0.44 % Net memory used: 109.177 MB
%------------------------------------------------------------------------------