%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC048-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/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:39:44 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 108 ( 39 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 113 ( 53 ~; 60 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f59,axiom,
! [U] :
( rearsegP(U,U)
| ~ ssList(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f82,axiom,
! [U] :
( nil = U
| ~ ssList(U)
| ~ rearsegP(nil,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f115,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ~ neq(U,V)
| U != V ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f188,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
! [A] :
( ~ rearsegP(sk1,A)
| ~ rearsegP(sk2,A)
| ~ neq(A,nil)
| ~ ssList(A)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f197,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f199,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f207,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f258,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f59]) ).
fof(f282,plain,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
inference(cnf_transformation,[status(thm)],[f82]) ).
fof(f320,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ~ neq(U,V)
| U != V ) ),
inference(miniscoping,[status(thm)],[f115]) ).
fof(f321,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(thm)],[f320]) ).
fof(f432,plain,
ssList(sk3),
inference(cnf_transformation,[status(thm)],[f188]) ).
fof(f434,plain,
sk2 = sk4,
inference(cnf_transformation,[status(thm)],[f190]) ).
fof(f435,plain,
sk1 = sk3,
inference(cnf_transformation,[status(thm)],[f191]) ).
fof(f437,plain,
! [X0] :
( ~ rearsegP(sk1,X0)
| ~ rearsegP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| nil = sk2 ),
inference(cnf_transformation,[status(thm)],[f193]) ).
fof(f438,plain,
( neq(sk2,nil)
| nil != sk1 ),
inference(cnf_transformation,[status(thm)],[f194]) ).
fof(f440,plain,
( neq(sk3,nil)
| nil = sk4 ),
inference(cnf_transformation,[status(thm)],[f196]) ).
fof(f441,plain,
( rearsegP(sk4,sk3)
| nil = sk4 ),
inference(cnf_transformation,[status(thm)],[f197]) ).
fof(f443,plain,
( rearsegP(sk4,sk3)
| nil = sk3 ),
inference(cnf_transformation,[status(thm)],[f199]) ).
fof(f451,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(thm)],[f321]) ).
fof(f452,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(thm)],[f451]) ).
fof(f475,plain,
( neq(sk2,nil)
| nil != sk3 ),
inference(forward_demodulation,[status(thm)],[f435,f438]) ).
fof(f476,plain,
( neq(sk3,nil)
| nil = sk2 ),
inference(forward_demodulation,[status(thm)],[f434,f440]) ).
fof(f477,plain,
! [X0] :
( ~ rearsegP(sk3,X0)
| ~ rearsegP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| nil = sk2 ),
inference(forward_demodulation,[status(thm)],[f435,f437]) ).
fof(f478,plain,
( nil = sk2
| ~ rearsegP(sk3,sk3)
| ~ rearsegP(sk2,sk3)
| ~ ssList(sk3)
| nil = sk2 ),
inference(resolution,[status(thm)],[f477,f476]) ).
fof(f481,plain,
( ~ rearsegP(sk3,sk3)
| ~ rearsegP(sk2,sk3)
| ~ ssList(sk3)
| nil = sk2 ),
inference(duplicate_literals_removal,[status(thm)],[f478]) ).
fof(f482,plain,
( ~ rearsegP(sk3,sk3)
| ~ rearsegP(sk2,sk3)
| nil = sk2 ),
inference(forward_subsumption_resolution,[status(thm)],[f481,f432]) ).
fof(f486,plain,
( rearsegP(sk4,sk3)
| nil = sk2 ),
inference(forward_demodulation,[status(thm)],[f434,f441]) ).
fof(f487,plain,
( rearsegP(sk2,sk3)
| nil = sk2 ),
inference(forward_demodulation,[status(thm)],[f434,f486]) ).
fof(f490,plain,
( rearsegP(sk2,sk3)
| nil = sk3 ),
inference(forward_demodulation,[status(thm)],[f434,f443]) ).
fof(f510,plain,
( ~ rearsegP(sk3,sk3)
| nil = sk2 ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f487]) ).
fof(f511,plain,
( ~ ssList(sk3)
| nil = sk2 ),
inference(resolution,[status(thm)],[f510,f258]) ).
fof(f512,plain,
nil = sk2,
inference(forward_subsumption_resolution,[status(thm)],[f511,f432]) ).
fof(f514,plain,
( rearsegP(nil,sk3)
| nil = sk3 ),
inference(backward_demodulation,[status(thm)],[f512,f490]) ).
fof(f518,plain,
( neq(nil,nil)
| nil != sk3 ),
inference(backward_demodulation,[status(thm)],[f512,f475]) ).
fof(f529,plain,
( nil = sk3
| ~ ssList(sk3)
| nil = sk3 ),
inference(resolution,[status(thm)],[f514,f282]) ).
fof(f531,plain,
( ~ ssList(sk3)
| nil = sk3 ),
inference(duplicate_literals_removal,[status(thm)],[f529]) ).
fof(f532,plain,
nil = sk3,
inference(forward_subsumption_resolution,[status(thm)],[f531,f432]) ).
fof(f543,plain,
( neq(nil,nil)
| nil != nil ),
inference(forward_demodulation,[status(thm)],[f532,f518]) ).
fof(f544,plain,
neq(nil,nil),
inference(trivial_equality_resolution,[status(thm)],[f543]) ).
fof(f546,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[f544,f452]) ).
fof(f547,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f546,f207]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC048-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 07:49:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.12/0.37 % Drodi V4.1.1
% 0.12/0.39 % Refutation found
% 0.12/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42 % Elapsed time: 0.063179 seconds
% 0.12/0.42 % CPU time: 0.174443 seconds
% 0.12/0.42 % Total memory used: 95.339 MB
% 0.12/0.42 % Net memory used: 95.188 MB
%------------------------------------------------------------------------------