TSTP Solution File: SWC332-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC332-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n032.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:45:23 EDT 2024
% Result : Unsatisfiable 3.71s 0.83s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 27
% Syntax : Number of formulae : 86 ( 24 unt; 0 def)
% Number of atoms : 177 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 162 ( 71 ~; 79 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 13 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 17 ( 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f47,axiom,
! [U] : ssItem(skaf44(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f56,axiom,
! [U] :
( ~ ssList(U)
| segmentP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f64,axiom,
! [U] :
( ~ ssItem(U)
| equalelemsP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f100,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| V = U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f101,axiom,
! [U] :
( ~ singletonP(U)
| ~ ssList(U)
| cons(skaf44(U),nil) = U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f127,axiom,
! [U,V] :
( ~ segmentP(U,V)
| ~ segmentP(V,U)
| ~ ssList(U)
| ~ ssList(V)
| V = U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f186,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f187,negated_conjecture,
ssList(sk2),
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(f192,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f195,plain,
equalelemsP(nil),
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f202,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f241,plain,
! [X0] : ssItem(skaf44(X0)),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f250,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f56]) ).
fof(f258,plain,
! [X0] :
( ~ ssItem(X0)
| equalelemsP(cons(X0,nil)) ),
inference(cnf_transformation,[status(esa)],[f64]) ).
fof(f297,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
inference(cnf_transformation,[status(esa)],[f100]) ).
fof(f298,plain,
! [X0] :
( ~ singletonP(X0)
| ~ ssList(X0)
| cons(skaf44(X0),nil) = X0 ),
inference(cnf_transformation,[status(esa)],[f101]) ).
fof(f334,plain,
! [X0,X1] :
( ~ segmentP(X0,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X0)
| ~ ssList(X1)
| X1 = X0 ),
inference(cnf_transformation,[status(esa)],[f127]) ).
fof(f425,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f426,plain,
ssList(sk2),
inference(cnf_transformation,[status(esa)],[f187]) ).
fof(f429,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f430,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f431,plain,
segmentP(sk4,sk3),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f432,plain,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f433,plain,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f441,plain,
( spl0_2
<=> singletonP(sk3) ),
introduced(split_symbol_definition) ).
fof(f442,plain,
( singletonP(sk3)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,plain,
( spl0_3
<=> neq(sk4,nil) ),
introduced(split_symbol_definition) ).
fof(f446,plain,
( ~ neq(sk4,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f444]) ).
fof(f447,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f432,f441,f444]) ).
fof(f448,plain,
( spl0_4
<=> segmentP(sk2,sk1) ),
introduced(split_symbol_definition) ).
fof(f450,plain,
( ~ segmentP(sk2,sk1)
| spl0_4 ),
inference(component_clause,[status(thm)],[f448]) ).
fof(f451,plain,
( spl0_5
<=> equalelemsP(sk1) ),
introduced(split_symbol_definition) ).
fof(f453,plain,
( ~ equalelemsP(sk1)
| spl0_5 ),
inference(component_clause,[status(thm)],[f451]) ).
fof(f454,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f433,f448,f451]) ).
fof(f486,plain,
segmentP(sk2,sk3),
inference(forward_demodulation,[status(thm)],[f429,f431]) ).
fof(f487,plain,
segmentP(sk2,sk1),
inference(forward_demodulation,[status(thm)],[f430,f486]) ).
fof(f488,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f450,f487]) ).
fof(f489,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f490,plain,
( ~ neq(sk2,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f429,f446]) ).
fof(f491,plain,
( spl0_6
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f493,plain,
( ~ ssList(nil)
| spl0_6 ),
inference(component_clause,[status(thm)],[f491]) ).
fof(f501,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f493,f202]) ).
fof(f502,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f501]) ).
fof(f505,plain,
! [X0] :
( ~ segmentP(X0,sk1)
| ~ segmentP(sk1,X0)
| ~ ssList(X0)
| sk1 = X0 ),
inference(resolution,[status(thm)],[f334,f425]) ).
fof(f509,plain,
( spl0_9
<=> ssList(sk2) ),
introduced(split_symbol_definition) ).
fof(f511,plain,
( ~ ssList(sk2)
| spl0_9 ),
inference(component_clause,[status(thm)],[f509]) ).
fof(f517,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f511,f426]) ).
fof(f518,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f517]) ).
fof(f523,plain,
( spl0_11
<=> segmentP(nil,sk1) ),
introduced(split_symbol_definition) ).
fof(f525,plain,
( ~ segmentP(nil,sk1)
| spl0_11 ),
inference(component_clause,[status(thm)],[f523]) ).
fof(f526,plain,
( spl0_12
<=> sk1 = nil ),
introduced(split_symbol_definition) ).
fof(f527,plain,
( sk1 = nil
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f526]) ).
fof(f529,plain,
( spl0_13
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f531,plain,
( ~ ssList(sk1)
| spl0_13 ),
inference(component_clause,[status(thm)],[f529]) ).
fof(f532,plain,
( ~ segmentP(nil,sk1)
| ~ ssList(nil)
| sk1 = nil
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[f505,f250]) ).
fof(f533,plain,
( ~ spl0_11
| ~ spl0_6
| spl0_12
| ~ spl0_13 ),
inference(split_clause,[status(thm)],[f532,f523,f491,f526,f529]) ).
fof(f545,plain,
( $false
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f531,f425]) ).
fof(f546,plain,
spl0_13,
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f575,plain,
( spl0_19
<=> sk2 = nil ),
introduced(split_symbol_definition) ).
fof(f576,plain,
( sk2 = nil
| ~ spl0_19 ),
inference(component_clause,[status(thm)],[f575]) ).
fof(f578,plain,
( ~ ssList(nil)
| ~ ssList(sk2)
| sk2 = nil
| spl0_3 ),
inference(resolution,[status(thm)],[f297,f490]) ).
fof(f579,plain,
( ~ spl0_6
| ~ spl0_9
| spl0_19
| spl0_3 ),
inference(split_clause,[status(thm)],[f578,f491,f509,f575,f444]) ).
fof(f580,plain,
( singletonP(sk1)
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f430,f442]) ).
fof(f590,plain,
( segmentP(nil,sk1)
| ~ spl0_19 ),
inference(backward_demodulation,[status(thm)],[f576,f487]) ).
fof(f591,plain,
( $false
| spl0_11
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[status(thm)],[f590,f525]) ).
fof(f592,plain,
( spl0_11
| ~ spl0_19 ),
inference(contradiction_clause,[status(thm)],[f591]) ).
fof(f1036,plain,
( spl0_89
<=> cons(skaf44(sk1),nil) = sk1 ),
introduced(split_symbol_definition) ).
fof(f1037,plain,
( cons(skaf44(sk1),nil) = sk1
| ~ spl0_89 ),
inference(component_clause,[status(thm)],[f1036]) ).
fof(f1039,plain,
( ~ ssList(sk1)
| cons(skaf44(sk1),nil) = sk1
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f298,f580]) ).
fof(f1040,plain,
( ~ spl0_13
| spl0_89
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f1039,f529,f1036,f441]) ).
fof(f1041,plain,
( spl0_90
<=> ssItem(skaf44(sk1)) ),
introduced(split_symbol_definition) ).
fof(f1043,plain,
( ~ ssItem(skaf44(sk1))
| spl0_90 ),
inference(component_clause,[status(thm)],[f1041]) ).
fof(f1052,plain,
( ~ ssItem(skaf44(sk1))
| equalelemsP(sk1)
| ~ spl0_89 ),
inference(paramodulation,[status(thm)],[f1037,f258]) ).
fof(f1053,plain,
( ~ spl0_90
| spl0_5
| ~ spl0_89 ),
inference(split_clause,[status(thm)],[f1052,f1041,f451,f1036]) ).
fof(f3154,plain,
( $false
| spl0_90 ),
inference(backward_subsumption_resolution,[status(thm)],[f1043,f241]) ).
fof(f3155,plain,
spl0_90,
inference(contradiction_clause,[status(thm)],[f3154]) ).
fof(f3172,plain,
( ~ equalelemsP(nil)
| ~ spl0_12
| spl0_5 ),
inference(backward_demodulation,[status(thm)],[f527,f453]) ).
fof(f3173,plain,
( $false
| ~ spl0_12
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f3172,f195]) ).
fof(f3174,plain,
( ~ spl0_12
| spl0_5 ),
inference(contradiction_clause,[status(thm)],[f3173]) ).
fof(f3175,plain,
$false,
inference(sat_refutation,[status(thm)],[f447,f454,f489,f502,f518,f533,f546,f579,f592,f1040,f1053,f3155,f3174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC332-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 00:19:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.33 % Drodi V3.6.0
% 3.71/0.83 % Refutation found
% 3.71/0.83 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 3.71/0.83 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.71/0.85 % Elapsed time: 0.514620 seconds
% 3.71/0.85 % CPU time: 3.902405 seconds
% 3.71/0.85 % Total memory used: 102.098 MB
% 3.71/0.85 % Net memory used: 99.901 MB
%------------------------------------------------------------------------------