%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV405+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:47:35 PM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 7 unt; 2 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 13 |; 4 &)
% ( 4 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 28 ( 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [U,V] : ~ pair_in_list(create_slb,U,V),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
! [U,V] : check_cpq(triple(U,create_slb,V)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f42,conjecture,
! [U,V] :
( check_cpq(triple(U,create_slb,V))
<=> ! [W,X] :
( pair_in_list(create_slb,W,X)
=> less_than(X,W) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f43,negated_conjecture,
~ ! [U,V] :
( check_cpq(triple(U,create_slb,V))
<=> ! [W,X] :
( pair_in_list(create_slb,W,X)
=> less_than(X,W) ) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f63,plain,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f96,plain,
! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f144,plain,
? [U,V] :
( check_cpq(triple(U,create_slb,V))
<~> ! [W,X] :
( less_than(X,W)
| ~ pair_in_list(create_slb,W,X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f43]) ).
fof(f145,plain,
? [U,V] :
( ( ? [W,X] :
( ~ less_than(X,W)
& pair_in_list(create_slb,W,X) )
| ~ check_cpq(triple(U,create_slb,V)) )
& ( ! [W,X] :
( less_than(X,W)
| ~ pair_in_list(create_slb,W,X) )
| check_cpq(triple(U,create_slb,V)) ) ),
inference(NNF_transformation,[status(thm)],[f144]) ).
fof(f146,plain,
( ( ( ~ less_than(sK3_skl,sK2_skl)
& pair_in_list(create_slb,sK2_skl,sK3_skl) )
| ~ check_cpq(triple(sK0_skl,create_slb,sK1_skl)) )
& ( ! [W,X] :
( less_than(X,W)
| ~ pair_in_list(create_slb,W,X) )
| check_cpq(triple(sK0_skl,create_slb,sK1_skl)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl,sK3_skl]),skolemize(U,sK0_skl),skolemize(V,sK1_skl),skolemize(W,sK2_skl),skolemize(X,sK3_skl)],[f145]) ).
fof(f148,plain,
( pair_in_list(create_slb,sK2_skl,sK3_skl)
| ~ check_cpq(triple(sK0_skl,create_slb,sK1_skl)) ),
inference(cnf_transformation,[status(thm)],[f146]) ).
fof(f150,definition,
( sQ0_spl
<=> check_cpq(triple(sK0_skl,create_slb,sK1_skl)) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f152,plain,
( sQ0_spl
| ~ check_cpq(triple(sK0_skl,create_slb,sK1_skl)) ),
inference(component_clause,[status(thm)],[f150]) ).
fof(f157,definition,
( sQ2_spl
<=> pair_in_list(create_slb,sK2_skl,sK3_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f158,plain,
( ~ sQ2_spl
| pair_in_list(create_slb,sK2_skl,sK3_skl) ),
inference(component_clause,[status(thm)],[f157]) ).
fof(f160,plain,
( sQ2_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f148,f150,f157]) ).
fof(f167,plain,
( sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f152,f96]) ).
fof(f168,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f167]) ).
fof(f169,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f158,f63]) ).
fof(f170,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f169]) ).
fof(f171,plain,
$false,
inference(sat_refutation,[status(thm)],[f160,f168,f170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV405+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n010.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 08:44:55 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.45 % Drodi V4.1.1
% 0.16/0.48 % Refutation found
% 0.16/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/0.51 % Elapsed time: 0.072511 seconds
% 0.24/0.51 % CPU time: 0.165726 seconds
% 0.24/0.51 % Total memory used: 70.821 MB
% 0.24/0.51 % Net memory used: 70.788 MB
%------------------------------------------------------------------------------