TSTP Solution File: SWC105-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC105-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:32 EDT 2024
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 26
% Syntax : Number of formulae : 86 ( 12 unt; 0 def)
% Number of atoms : 186 ( 36 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 181 ( 81 ~; 88 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 13 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f59,axiom,
! [U] :
( ~ ssList(U)
| rearsegP(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f82,axiom,
! [U] :
( ~ rearsegP(nil,U)
| ~ ssList(U)
| nil = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f115,axiom,
! [U,V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f186,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f190,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f191,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f192,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
( nil != sk1
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f197,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f199,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f207,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f258,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f59]) ).
fof(f282,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f82]) ).
fof(f320,plain,
! [U] :
( ! [V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V) )
| ~ ssList(U) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f321,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f320]) ).
fof(f430,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f434,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f435,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f436,plain,
( nil = sk2
| neq(sk2,nil) ),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f437,plain,
( nil = sk2
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f438,plain,
( nil != sk1
| neq(sk2,nil) ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f439,plain,
( nil != sk1
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
inference(cnf_transformation,[status(esa)],[f195]) ).
fof(f440,plain,
( nil = sk4
| neq(sk3,nil) ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f441,plain,
( nil = sk4
| rearsegP(sk4,sk3) ),
inference(cnf_transformation,[status(esa)],[f197]) ).
fof(f443,plain,
( nil = sk3
| rearsegP(sk4,sk3) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f451,plain,
( spl0_2
<=> nil = sk2 ),
introduced(split_symbol_definition) ).
fof(f452,plain,
( nil = sk2
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f451]) ).
fof(f454,plain,
( spl0_3
<=> neq(sk2,nil) ),
introduced(split_symbol_definition) ).
fof(f455,plain,
( neq(sk2,nil)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f454]) ).
fof(f457,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f436,f451,f454]) ).
fof(f458,plain,
( spl0_4
<=> neq(sk1,nil) ),
introduced(split_symbol_definition) ).
fof(f460,plain,
( ~ neq(sk1,nil)
| spl0_4 ),
inference(component_clause,[status(thm)],[f458]) ).
fof(f461,plain,
( spl0_5
<=> rearsegP(sk2,sk1) ),
introduced(split_symbol_definition) ).
fof(f463,plain,
( ~ rearsegP(sk2,sk1)
| spl0_5 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( spl0_2
| ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f437,f451,f458,f461]) ).
fof(f465,plain,
( spl0_6
<=> nil = sk1 ),
introduced(split_symbol_definition) ).
fof(f467,plain,
( nil != sk1
| spl0_6 ),
inference(component_clause,[status(thm)],[f465]) ).
fof(f468,plain,
( ~ spl0_6
| spl0_3 ),
inference(split_clause,[status(thm)],[f438,f465,f454]) ).
fof(f469,plain,
( ~ spl0_6
| ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f439,f465,f458,f461]) ).
fof(f470,plain,
( spl0_7
<=> nil = sk4 ),
introduced(split_symbol_definition) ).
fof(f471,plain,
( nil = sk4
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f470]) ).
fof(f473,plain,
( spl0_8
<=> neq(sk3,nil) ),
introduced(split_symbol_definition) ).
fof(f474,plain,
( neq(sk3,nil)
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f473]) ).
fof(f476,plain,
( spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f440,f470,f473]) ).
fof(f477,plain,
( spl0_9
<=> rearsegP(sk4,sk3) ),
introduced(split_symbol_definition) ).
fof(f478,plain,
( rearsegP(sk4,sk3)
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f477]) ).
fof(f480,plain,
( spl0_7
| spl0_9 ),
inference(split_clause,[status(thm)],[f441,f470,f477]) ).
fof(f481,plain,
( spl0_10
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f482,plain,
( nil = sk3
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f481]) ).
fof(f485,plain,
( spl0_10
| spl0_9 ),
inference(split_clause,[status(thm)],[f443,f481,f477]) ).
fof(f493,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f321]) ).
fof(f494,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f493]) ).
fof(f517,plain,
rearsegP(nil,nil),
inference(resolution,[status(thm)],[f258,f207]) ).
fof(f523,plain,
( spl0_11
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f525,plain,
( ~ ssList(nil)
| spl0_11 ),
inference(component_clause,[status(thm)],[f523]) ).
fof(f526,plain,
( spl0_12
<=> nil = nil ),
introduced(split_symbol_definition) ).
fof(f529,plain,
( ~ ssList(nil)
| nil = nil ),
inference(resolution,[status(thm)],[f282,f517]) ).
fof(f530,plain,
( ~ spl0_11
| spl0_12 ),
inference(split_clause,[status(thm)],[f529,f523,f526]) ).
fof(f531,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f525,f207]) ).
fof(f532,plain,
spl0_11,
inference(contradiction_clause,[status(thm)],[f531]) ).
fof(f541,plain,
( nil = sk1
| ~ spl0_10 ),
inference(forward_demodulation,[status(thm)],[f435,f482]) ).
fof(f542,plain,
( $false
| spl0_6
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f541,f467]) ).
fof(f543,plain,
( spl0_6
| ~ spl0_10 ),
inference(contradiction_clause,[status(thm)],[f542]) ).
fof(f544,plain,
( neq(sk1,nil)
| ~ spl0_8 ),
inference(forward_demodulation,[status(thm)],[f435,f474]) ).
fof(f545,plain,
( rearsegP(sk2,sk3)
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f434,f478]) ).
fof(f546,plain,
( rearsegP(sk2,sk1)
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f435,f545]) ).
fof(f561,plain,
( rearsegP(nil,sk1)
| ~ spl0_2
| ~ spl0_9 ),
inference(forward_demodulation,[status(thm)],[f452,f546]) ).
fof(f562,plain,
( spl0_13
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f564,plain,
( ~ ssList(sk1)
| spl0_13 ),
inference(component_clause,[status(thm)],[f562]) ).
fof(f565,plain,
( ~ ssList(sk1)
| nil = sk1
| ~ spl0_2
| ~ spl0_9 ),
inference(resolution,[status(thm)],[f561,f282]) ).
fof(f566,plain,
( ~ spl0_13
| spl0_6
| ~ spl0_2
| ~ spl0_9 ),
inference(split_clause,[status(thm)],[f565,f562,f465,f451,f477]) ).
fof(f567,plain,
( $false
| spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f546,f463]) ).
fof(f568,plain,
( spl0_5
| ~ spl0_9 ),
inference(contradiction_clause,[status(thm)],[f567]) ).
fof(f569,plain,
( $false
| ~ spl0_8
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f460,f544]) ).
fof(f570,plain,
( ~ spl0_8
| spl0_4 ),
inference(contradiction_clause,[status(thm)],[f569]) ).
fof(f585,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f430,f564]) ).
fof(f586,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f585]) ).
fof(f589,plain,
( sk2 = nil
| ~ spl0_7 ),
inference(forward_demodulation,[status(thm)],[f471,f434]) ).
fof(f665,plain,
( neq(nil,nil)
| ~ spl0_7
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f589,f455]) ).
fof(f667,plain,
( ~ ssList(nil)
| ~ spl0_7
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f665,f494]) ).
fof(f668,plain,
( ~ spl0_11
| ~ spl0_7
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f667,f523,f470,f454]) ).
fof(f669,plain,
$false,
inference(sat_refutation,[status(thm)],[f457,f464,f468,f469,f476,f480,f485,f530,f532,f543,f566,f568,f570,f586,f668]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC105-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 00:40:40 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.6.0
% 0.12/0.35 % Refutation found
% 0.12/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37 % Elapsed time: 0.025120 seconds
% 0.12/0.37 % CPU time: 0.043520 seconds
% 0.12/0.37 % Total memory used: 16.497 MB
% 0.12/0.37 % Net memory used: 16.471 MB
%------------------------------------------------------------------------------