TSTP Solution File: SWC116+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC116+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:44:35 EDT 2024
% Result : Theorem 0.10s 0.33s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 32
% Syntax : Number of formulae : 147 ( 17 unt; 0 def)
% Number of atoms : 375 ( 80 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 373 ( 145 ~; 148 |; 35 &)
% ( 30 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 30 ( 28 usr; 25 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 52 ( 46 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
? [U] :
( ssItem(U)
& ? [V] :
( ssItem(V)
& U != V ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f55,axiom,
! [U] :
( ssList(U)
=> segmentP(U,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f57,axiom,
! [U] :
( ssList(U)
=> segmentP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f58,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> nil = U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ( nil != W
& nil = X )
| ( nil = V
& nil = U )
| ( neq(U,nil)
& segmentP(V,U) )
| ( neq(X,nil)
& ( ~ neq(W,nil)
| ~ segmentP(X,W) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ( nil != W
& nil = X )
| ( nil = V
& nil = U )
| ( neq(U,nil)
& segmentP(V,U) )
| ( neq(X,nil)
& ( ~ neq(W,nil)
| ~ segmentP(X,W) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
! [U] :
( ~ ssItem(U)
| ! [V] :
( ~ ssItem(V)
| ( neq(U,V)
<=> U != V ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f99,plain,
! [U] :
( ~ ssItem(U)
| ! [V] :
( ~ ssItem(V)
| ( ( ~ neq(U,V)
| U != V )
& ( neq(U,V)
| U = V ) ) ) ),
inference(NNF_transformation,[status(esa)],[f98]) ).
fof(f100,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| neq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f99]) ).
fof(f102,plain,
( ssItem(sk0_0)
& ssItem(sk0_1)
& sk0_0 != sk0_1 ),
inference(skolemization,[status(esa)],[f2]) ).
fof(f103,plain,
ssItem(sk0_0),
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f104,plain,
ssItem(sk0_1),
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f105,plain,
sk0_0 != sk0_1,
inference(cnf_transformation,[status(esa)],[f102]) ).
fof(f217,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( neq(U,V)
<=> U != V ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f218,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ neq(U,V)
| U != V )
& ( neq(U,V)
| U = V ) ) ) ),
inference(NNF_transformation,[status(esa)],[f217]) ).
fof(f219,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f218]) ).
fof(f220,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f218]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f318,plain,
! [U] :
( ~ ssList(U)
| segmentP(U,U) ),
inference(pre_NNF_transformation,[status(esa)],[f55]) ).
fof(f319,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f318]) ).
fof(f322,plain,
! [U] :
( ~ ssList(U)
| segmentP(U,nil) ),
inference(pre_NNF_transformation,[status(esa)],[f57]) ).
fof(f323,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f322]) ).
fof(f324,plain,
! [U] :
( ~ ssList(U)
| ( segmentP(nil,U)
<=> nil = U ) ),
inference(pre_NNF_transformation,[status(esa)],[f58]) ).
fof(f325,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ segmentP(nil,U)
| nil = U )
& ( segmentP(nil,U)
| nil != U ) ) ),
inference(NNF_transformation,[status(esa)],[f324]) ).
fof(f326,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f325]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( nil = W
| nil != X )
& ( nil != V
| nil != U )
& ( ~ neq(U,nil)
| ~ segmentP(V,U) )
& ( ~ neq(X,nil)
| ( neq(W,nil)
& segmentP(X,W) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ( nil = sk0_49
| nil != sk0_50 )
& ( nil != sk0_48
| nil != sk0_47 )
& ( ~ neq(sk0_47,nil)
| ~ segmentP(sk0_48,sk0_47) )
& ( ~ neq(sk0_50,nil)
| ( neq(sk0_49,nil)
& segmentP(sk0_50,sk0_49) ) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f417,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f418,plain,
ssList(sk0_48),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f421,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f422,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
( nil = sk0_49
| nil != sk0_50 ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
( nil != sk0_48
| nil != sk0_47 ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
( ~ neq(sk0_47,nil)
| ~ segmentP(sk0_48,sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( ~ neq(sk0_50,nil)
| neq(sk0_49,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( ~ neq(sk0_50,nil)
| segmentP(sk0_50,sk0_49) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
( spl0_0
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f429,plain,
( nil = sk0_49
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f428]) ).
fof(f431,plain,
( spl0_1
<=> nil = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f433,plain,
( nil != sk0_50
| spl0_1 ),
inference(component_clause,[status(thm)],[f431]) ).
fof(f434,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f423,f428,f431]) ).
fof(f435,plain,
( spl0_2
<=> nil = sk0_48 ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( nil = sk0_48
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f438,plain,
( spl0_3
<=> nil = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f441,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f424,f435,f438]) ).
fof(f442,plain,
( spl0_4
<=> neq(sk0_47,nil) ),
introduced(split_symbol_definition) ).
fof(f444,plain,
( ~ neq(sk0_47,nil)
| spl0_4 ),
inference(component_clause,[status(thm)],[f442]) ).
fof(f445,plain,
( spl0_5
<=> segmentP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f447,plain,
( ~ segmentP(sk0_48,sk0_47)
| spl0_5 ),
inference(component_clause,[status(thm)],[f445]) ).
fof(f448,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f425,f442,f445]) ).
fof(f449,plain,
( spl0_6
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f451,plain,
( ~ neq(sk0_50,nil)
| spl0_6 ),
inference(component_clause,[status(thm)],[f449]) ).
fof(f452,plain,
( spl0_7
<=> neq(sk0_49,nil) ),
introduced(split_symbol_definition) ).
fof(f453,plain,
( neq(sk0_49,nil)
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f452]) ).
fof(f455,plain,
( ~ spl0_6
| spl0_7 ),
inference(split_clause,[status(thm)],[f426,f449,f452]) ).
fof(f456,plain,
( spl0_8
<=> segmentP(sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f457,plain,
( segmentP(sk0_50,sk0_49)
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f456]) ).
fof(f459,plain,
( ~ spl0_6
| spl0_8 ),
inference(split_clause,[status(thm)],[f427,f449,f456]) ).
fof(f460,plain,
! [X1] :
( ~ ssItem(X1)
| ~ ssItem(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(esa)],[f100]) ).
fof(f461,plain,
! [X0] :
( ~ ssItem(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f460]) ).
fof(f475,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(esa)],[f219]) ).
fof(f476,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f475]) ).
fof(f492,plain,
segmentP(nil,nil),
inference(resolution,[status(thm)],[f319,f223]) ).
fof(f496,plain,
segmentP(sk0_48,nil),
inference(resolution,[status(thm)],[f323,f418]) ).
fof(f498,plain,
! [X0] :
( ~ ssItem(X0)
| neq(sk0_0,X0)
| sk0_0 = X0 ),
inference(resolution,[status(thm)],[f103,f101]) ).
fof(f499,plain,
! [X0] :
( ~ ssItem(X0)
| neq(sk0_1,X0)
| sk0_1 = X0 ),
inference(resolution,[status(thm)],[f104,f101]) ).
fof(f505,plain,
( ~ neq(sk0_48,nil)
| spl0_6 ),
inference(forward_demodulation,[status(thm)],[f421,f451]) ).
fof(f506,plain,
( spl0_9
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f508,plain,
( ~ ssList(nil)
| spl0_9 ),
inference(component_clause,[status(thm)],[f506]) ).
fof(f509,plain,
( spl0_10
<=> nil = nil ),
introduced(split_symbol_definition) ).
fof(f512,plain,
( ~ ssList(nil)
| nil = nil ),
inference(resolution,[status(thm)],[f326,f492]) ).
fof(f513,plain,
( ~ spl0_9
| spl0_10 ),
inference(split_clause,[status(thm)],[f512,f506,f509]) ).
fof(f514,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f508,f223]) ).
fof(f515,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f514]) ).
fof(f516,plain,
( spl0_11
<=> neq(sk0_0,sk0_1) ),
introduced(split_symbol_definition) ).
fof(f519,plain,
( spl0_12
<=> sk0_0 = sk0_1 ),
introduced(split_symbol_definition) ).
fof(f520,plain,
( sk0_0 = sk0_1
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f519]) ).
fof(f522,plain,
( neq(sk0_0,sk0_1)
| sk0_0 = sk0_1 ),
inference(resolution,[status(thm)],[f498,f104]) ).
fof(f523,plain,
( spl0_11
| spl0_12 ),
inference(split_clause,[status(thm)],[f522,f516,f519]) ).
fof(f524,plain,
( spl0_13
<=> neq(sk0_0,sk0_0) ),
introduced(split_symbol_definition) ).
fof(f525,plain,
( neq(sk0_0,sk0_0)
| ~ spl0_13 ),
inference(component_clause,[status(thm)],[f524]) ).
fof(f527,plain,
( spl0_14
<=> sk0_0 = sk0_0 ),
introduced(split_symbol_definition) ).
fof(f530,plain,
( neq(sk0_0,sk0_0)
| sk0_0 = sk0_0 ),
inference(resolution,[status(thm)],[f498,f103]) ).
fof(f531,plain,
( spl0_13
| spl0_14 ),
inference(split_clause,[status(thm)],[f530,f524,f527]) ).
fof(f533,plain,
( ~ ssItem(sk0_0)
| ~ spl0_13 ),
inference(resolution,[status(thm)],[f525,f461]) ).
fof(f534,plain,
( $false
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f533,f103]) ).
fof(f535,plain,
~ spl0_13,
inference(contradiction_clause,[status(thm)],[f534]) ).
fof(f536,plain,
( spl0_15
<=> neq(sk0_1,sk0_1) ),
introduced(split_symbol_definition) ).
fof(f537,plain,
( neq(sk0_1,sk0_1)
| ~ spl0_15 ),
inference(component_clause,[status(thm)],[f536]) ).
fof(f539,plain,
( spl0_16
<=> sk0_1 = sk0_1 ),
introduced(split_symbol_definition) ).
fof(f542,plain,
( neq(sk0_1,sk0_1)
| sk0_1 = sk0_1 ),
inference(resolution,[status(thm)],[f499,f104]) ).
fof(f543,plain,
( spl0_15
| spl0_16 ),
inference(split_clause,[status(thm)],[f542,f536,f539]) ).
fof(f544,plain,
( spl0_17
<=> neq(sk0_1,sk0_0) ),
introduced(split_symbol_definition) ).
fof(f547,plain,
( neq(sk0_1,sk0_0)
| sk0_1 = sk0_0 ),
inference(resolution,[status(thm)],[f499,f103]) ).
fof(f548,plain,
( spl0_17
| spl0_12 ),
inference(split_clause,[status(thm)],[f547,f544,f519]) ).
fof(f549,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f520,f105]) ).
fof(f550,plain,
~ spl0_12,
inference(contradiction_clause,[status(thm)],[f549]) ).
fof(f552,plain,
( ~ ssItem(sk0_1)
| ~ spl0_15 ),
inference(resolution,[status(thm)],[f537,f461]) ).
fof(f553,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f552,f104]) ).
fof(f554,plain,
~ spl0_15,
inference(contradiction_clause,[status(thm)],[f553]) ).
fof(f556,plain,
! [X0] :
( ~ ssList(X0)
| neq(sk0_48,X0)
| sk0_48 = X0 ),
inference(resolution,[status(thm)],[f220,f418]) ).
fof(f557,plain,
! [X0] :
( ~ ssList(X0)
| neq(sk0_47,X0)
| sk0_47 = X0 ),
inference(resolution,[status(thm)],[f220,f417]) ).
fof(f558,plain,
( spl0_18
<=> neq(sk0_48,nil) ),
introduced(split_symbol_definition) ).
fof(f559,plain,
( neq(sk0_48,nil)
| ~ spl0_18 ),
inference(component_clause,[status(thm)],[f558]) ).
fof(f561,plain,
( neq(sk0_48,nil)
| sk0_48 = nil ),
inference(resolution,[status(thm)],[f556,f223]) ).
fof(f562,plain,
( spl0_18
| spl0_2 ),
inference(split_clause,[status(thm)],[f561,f558,f435]) ).
fof(f563,plain,
( spl0_19
<=> neq(sk0_48,sk0_48) ),
introduced(split_symbol_definition) ).
fof(f564,plain,
( neq(sk0_48,sk0_48)
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f563]) ).
fof(f566,plain,
( spl0_20
<=> sk0_48 = sk0_48 ),
introduced(split_symbol_definition) ).
fof(f569,plain,
( neq(sk0_48,sk0_48)
| sk0_48 = sk0_48 ),
inference(resolution,[status(thm)],[f556,f418]) ).
fof(f570,plain,
( spl0_19
| spl0_20 ),
inference(split_clause,[status(thm)],[f569,f563,f566]) ).
fof(f571,plain,
( spl0_21
<=> neq(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f572,plain,
( neq(sk0_48,sk0_47)
| ~ spl0_21 ),
inference(component_clause,[status(thm)],[f571]) ).
fof(f574,plain,
( spl0_22
<=> sk0_48 = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f577,plain,
( neq(sk0_48,sk0_47)
| sk0_48 = sk0_47 ),
inference(resolution,[status(thm)],[f556,f417]) ).
fof(f578,plain,
( spl0_21
| spl0_22 ),
inference(split_clause,[status(thm)],[f577,f571,f574]) ).
fof(f579,plain,
( $false
| spl0_6
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[status(thm)],[f559,f505]) ).
fof(f580,plain,
( spl0_6
| ~ spl0_18 ),
inference(contradiction_clause,[status(thm)],[f579]) ).
fof(f581,plain,
( nil != sk0_48
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f421,f433]) ).
fof(f582,plain,
( neq(sk0_47,nil)
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f422,f453]) ).
fof(f583,plain,
( $false
| spl0_4
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f582,f444]) ).
fof(f584,plain,
( spl0_4
| ~ spl0_7 ),
inference(contradiction_clause,[status(thm)],[f583]) ).
fof(f585,plain,
( $false
| spl0_1
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f436,f581]) ).
fof(f586,plain,
( spl0_1
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f585]) ).
fof(f587,plain,
( segmentP(sk0_48,sk0_49)
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f421,f457]) ).
fof(f588,plain,
( segmentP(sk0_48,sk0_47)
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f422,f587]) ).
fof(f589,plain,
( nil = sk0_47
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f422,f429]) ).
fof(f598,plain,
( neq(sk0_48,nil)
| ~ spl0_0
| ~ spl0_21 ),
inference(forward_demodulation,[status(thm)],[f589,f572]) ).
fof(f599,plain,
( ~ ssList(sk0_48)
| ~ spl0_19 ),
inference(resolution,[status(thm)],[f564,f476]) ).
fof(f600,plain,
( $false
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f599,f418]) ).
fof(f601,plain,
~ spl0_19,
inference(contradiction_clause,[status(thm)],[f600]) ).
fof(f602,plain,
( ~ segmentP(sk0_48,nil)
| ~ spl0_0
| spl0_5 ),
inference(forward_demodulation,[status(thm)],[f589,f447]) ).
fof(f603,plain,
( $false
| ~ spl0_0
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f602,f496]) ).
fof(f604,plain,
( ~ spl0_0
| spl0_5 ),
inference(contradiction_clause,[status(thm)],[f603]) ).
fof(f605,plain,
( $false
| ~ spl0_8
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f447,f588]) ).
fof(f606,plain,
( ~ spl0_8
| spl0_5 ),
inference(contradiction_clause,[status(thm)],[f605]) ).
fof(f608,plain,
( spl0_18
| ~ spl0_0
| ~ spl0_21 ),
inference(split_clause,[status(thm)],[f598,f558,f428,f571]) ).
fof(f623,plain,
( neq(sk0_47,nil)
| sk0_47 = nil ),
inference(resolution,[status(thm)],[f557,f223]) ).
fof(f624,plain,
( spl0_4
| spl0_3 ),
inference(split_clause,[status(thm)],[f623,f442,f438]) ).
fof(f625,plain,
( spl0_25
<=> neq(sk0_47,sk0_48) ),
introduced(split_symbol_definition) ).
fof(f628,plain,
( neq(sk0_47,sk0_48)
| sk0_47 = sk0_48 ),
inference(resolution,[status(thm)],[f557,f418]) ).
fof(f629,plain,
( spl0_25
| spl0_22 ),
inference(split_clause,[status(thm)],[f628,f625,f574]) ).
fof(f630,plain,
$false,
inference(sat_refutation,[status(thm)],[f434,f441,f448,f455,f459,f513,f515,f523,f531,f535,f543,f548,f550,f554,f562,f570,f578,f580,f584,f586,f601,f604,f606,f608,f624,f629]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC116+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n015.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 30 00:26:32 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.6.0
% 0.10/0.33 % Refutation found
% 0.10/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.35 % Elapsed time: 0.023942 seconds
% 0.15/0.35 % CPU time: 0.042265 seconds
% 0.15/0.35 % Total memory used: 16.800 MB
% 0.15/0.35 % Net memory used: 16.768 MB
%------------------------------------------------------------------------------