TSTP Solution File: SWC101-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC101-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:31 EDT 2024
% Result : Unsatisfiable 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 66 ( 18 unt; 0 def)
% Number of atoms : 140 ( 32 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 136 ( 62 ~; 65 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f85,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
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(f144,axiom,
! [U,V,W] :
( app(U,V) != W
| ~ ssList(V)
| ~ ssList(U)
| ~ ssList(W)
| frontsegP(W,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f186,negated_conjecture,
ssList(sk1),
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,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f197,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f198,negated_conjecture,
( ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f206,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f284,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f85]) ).
fof(f301,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
inference(cnf_transformation,[status(esa)],[f100]) ).
fof(f358,plain,
! [U,W] :
( ! [V] :
( app(U,V) != W
| ~ ssList(V) )
| ~ ssList(U)
| ~ ssList(W)
| frontsegP(W,U) ),
inference(miniscoping,[status(esa)],[f144]) ).
fof(f359,plain,
! [X0,X1,X2] :
( app(X0,X1) != X2
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| frontsegP(X2,X0) ),
inference(cnf_transformation,[status(esa)],[f358]) ).
fof(f429,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f433,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f434,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f435,plain,
ssList(sk5),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f436,plain,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f440,plain,
( nil = sk4
| nil != sk3 ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f441,plain,
( nil != sk2
| nil != sk1 ),
inference(cnf_transformation,[status(esa)],[f197]) ).
fof(f442,plain,
( ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
inference(cnf_transformation,[status(esa)],[f198]) ).
fof(f450,plain,
( spl0_2
<=> nil = sk4 ),
introduced(split_symbol_definition) ).
fof(f451,plain,
( nil = sk4
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f450]) ).
fof(f453,plain,
( spl0_3
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f455,plain,
( nil != sk3
| spl0_3 ),
inference(component_clause,[status(thm)],[f453]) ).
fof(f456,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f440,f450,f453]) ).
fof(f457,plain,
( spl0_4
<=> nil = sk2 ),
introduced(split_symbol_definition) ).
fof(f459,plain,
( nil != sk2
| spl0_4 ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( spl0_5
<=> nil = sk1 ),
introduced(split_symbol_definition) ).
fof(f461,plain,
( nil = sk1
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f460]) ).
fof(f463,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f441,f457,f460]) ).
fof(f464,plain,
( spl0_6
<=> neq(sk1,nil) ),
introduced(split_symbol_definition) ).
fof(f466,plain,
( ~ neq(sk1,nil)
| spl0_6 ),
inference(component_clause,[status(thm)],[f464]) ).
fof(f467,plain,
( spl0_7
<=> frontsegP(sk2,sk1) ),
introduced(split_symbol_definition) ).
fof(f470,plain,
( ~ spl0_6
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f442,f464,f467]) ).
fof(f486,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X1,X0))
| frontsegP(app(X1,X0),X1) ),
inference(destructive_equality_resolution,[status(esa)],[f359]) ).
fof(f503,plain,
app(sk1,sk5) = sk4,
inference(forward_demodulation,[status(thm)],[f434,f436]) ).
fof(f504,plain,
app(sk1,sk5) = sk2,
inference(forward_demodulation,[status(thm)],[f433,f503]) ).
fof(f505,plain,
( nil != sk1
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f434,f455]) ).
fof(f516,plain,
( spl0_8
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f518,plain,
( ~ ssList(nil)
| spl0_8 ),
inference(component_clause,[status(thm)],[f516]) ).
fof(f526,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f518,f206]) ).
fof(f527,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f526]) ).
fof(f529,plain,
( spl0_10
<=> ssList(sk5) ),
introduced(split_symbol_definition) ).
fof(f531,plain,
( ~ ssList(sk5)
| spl0_10 ),
inference(component_clause,[status(thm)],[f529]) ).
fof(f532,plain,
( spl0_11
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f534,plain,
( ~ ssList(sk1)
| spl0_11 ),
inference(component_clause,[status(thm)],[f532]) ).
fof(f540,plain,
( $false
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f534,f429]) ).
fof(f541,plain,
spl0_11,
inference(contradiction_clause,[status(thm)],[f540]) ).
fof(f542,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f531,f435]) ).
fof(f543,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f542]) ).
fof(f555,plain,
( ~ ssList(nil)
| ~ ssList(sk1)
| sk1 = nil
| spl0_6 ),
inference(resolution,[status(thm)],[f301,f466]) ).
fof(f556,plain,
( ~ spl0_8
| ~ spl0_11
| spl0_5
| spl0_6 ),
inference(split_clause,[status(thm)],[f555,f516,f532,f460,f464]) ).
fof(f557,plain,
( $false
| spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f461,f505]) ).
fof(f558,plain,
( spl0_3
| ~ spl0_5 ),
inference(contradiction_clause,[status(thm)],[f557]) ).
fof(f559,plain,
( nil = sk2
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f433,f451]) ).
fof(f560,plain,
( $false
| spl0_4
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f559,f459]) ).
fof(f561,plain,
( spl0_4
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f560]) ).
fof(f595,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X1,X0),X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f284]) ).
fof(f599,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| frontsegP(sk2,sk1) ),
inference(paramodulation,[status(thm)],[f504,f595]) ).
fof(f600,plain,
( ~ spl0_10
| ~ spl0_11
| spl0_7 ),
inference(split_clause,[status(thm)],[f599,f529,f532,f467]) ).
fof(f601,plain,
$false,
inference(sat_refutation,[status(thm)],[f456,f463,f470,f527,f541,f543,f556,f558,f561,f600]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC101-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 00:00:18 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.37 % Drodi V3.6.0
% 0.14/0.37 % Refutation found
% 0.14/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.39 % Elapsed time: 0.029088 seconds
% 0.14/0.39 % CPU time: 0.050687 seconds
% 0.14/0.39 % Total memory used: 14.535 MB
% 0.14/0.39 % Net memory used: 14.509 MB
%------------------------------------------------------------------------------