TSTP Solution File: SWC032-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC032-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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 : Wed May 31 12:38:57 EDT 2023
% Result : Unsatisfiable 0.06s 0.27s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 56 ( 15 unt; 0 def)
% Number of atoms : 113 ( 39 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 103 ( 46 ~; 50 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f85,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f118,axiom,
! [U,V] :
( app(U,V) != nil
| ~ ssList(V)
| ~ ssList(U)
| nil = 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(f200,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f286,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f85]) ).
fof(f327,plain,
! [U] :
( ! [V] :
( app(U,V) != nil
| ~ ssList(V) )
| ~ ssList(U)
| nil = U ),
inference(miniscoping,[status(esa)],[f118]) ).
fof(f328,plain,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f327]) ).
fof(f431,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f435,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f436,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f437,plain,
ssList(sk5),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f438,plain,
app(sk3,sk5) = sk4,
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f442,plain,
( nil = sk4
| nil != sk3 ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f443,plain,
( nil = sk2
| nil = sk1 ),
inference(cnf_transformation,[status(esa)],[f197]) ).
fof(f446,plain,
( nil != sk1
| nil != sk2 ),
inference(cnf_transformation,[status(esa)],[f200]) ).
fof(f454,plain,
( spl0_2
<=> nil = sk4 ),
introduced(split_symbol_definition) ).
fof(f455,plain,
( nil = sk4
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f454]) ).
fof(f457,plain,
( spl0_3
<=> nil = sk3 ),
introduced(split_symbol_definition) ).
fof(f459,plain,
( nil != sk3
| spl0_3 ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f442,f454,f457]) ).
fof(f461,plain,
( spl0_4
<=> nil = sk2 ),
introduced(split_symbol_definition) ).
fof(f462,plain,
( nil = sk2
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f463,plain,
( nil != sk2
| spl0_4 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( spl0_5
<=> nil = sk1 ),
introduced(split_symbol_definition) ).
fof(f465,plain,
( nil = sk1
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f464]) ).
fof(f467,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f443,f461,f464]) ).
fof(f470,plain,
( ~ spl0_5
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f446,f464,f461]) ).
fof(f503,plain,
app(sk1,sk5) = sk4,
inference(forward_demodulation,[status(thm)],[f436,f438]) ).
fof(f504,plain,
app(sk1,sk5) = sk2,
inference(forward_demodulation,[status(thm)],[f435,f503]) ).
fof(f505,plain,
( spl0_6
<=> ssList(sk5) ),
introduced(split_symbol_definition) ).
fof(f507,plain,
( ~ ssList(sk5)
| spl0_6 ),
inference(component_clause,[status(thm)],[f505]) ).
fof(f508,plain,
( spl0_7
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f510,plain,
( ~ ssList(sk1)
| spl0_7 ),
inference(component_clause,[status(thm)],[f508]) ).
fof(f511,plain,
( spl0_8
<=> ssList(sk2) ),
introduced(split_symbol_definition) ).
fof(f514,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| ssList(sk2) ),
inference(paramodulation,[status(thm)],[f504,f286]) ).
fof(f515,plain,
( ~ spl0_6
| ~ spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f514,f505,f508,f511]) ).
fof(f516,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f510,f431]) ).
fof(f517,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f518,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f507,f437]) ).
fof(f519,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f518]) ).
fof(f520,plain,
( nil != sk1
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f436,f459]) ).
fof(f521,plain,
( app(sk1,sk5) = nil
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f462,f504]) ).
fof(f529,plain,
( $false
| spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f465,f520]) ).
fof(f530,plain,
( spl0_3
| ~ spl0_5 ),
inference(contradiction_clause,[status(thm)],[f529]) ).
fof(f544,plain,
( sk2 = nil
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f455,f435]) ).
fof(f545,plain,
( $false
| spl0_4
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f544,f463]) ).
fof(f546,plain,
( spl0_4
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f565,plain,
( ~ ssList(sk5)
| ~ ssList(sk1)
| nil = sk1
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f328,f521]) ).
fof(f566,plain,
( ~ spl0_6
| ~ spl0_7
| spl0_5
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f565,f505,f508,f464,f461]) ).
fof(f576,plain,
$false,
inference(sat_refutation,[status(thm)],[f460,f467,f470,f515,f517,f519,f530,f546,f566]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC032-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26 % Computer : n008.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Tue May 30 11:26:38 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.26 % Drodi V3.5.1
% 0.06/0.27 % Refutation found
% 0.06/0.27 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.06/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.06/0.27 % Elapsed time: 0.016091 seconds
% 0.06/0.27 % CPU time: 0.028558 seconds
% 0.06/0.27 % Memory used: 18.072 MB
%------------------------------------------------------------------------------