TSTP Solution File: SWC217-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC217-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n001.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:39:42 EDT 2023
% Result : Unsatisfiable 0.15s 0.35s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 48 ( 16 unt; 0 def)
% Number of atoms : 94 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 88 ( 42 ~; 40 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f98,axiom,
! [U,V] :
( cons(U,V) != nil
| ~ ssItem(U)
| ~ ssList(V) ),
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(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,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f195,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f205,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f296,plain,
! [V] :
( ! [U] :
( cons(U,V) != nil
| ~ ssItem(U) )
| ~ ssList(V) ),
inference(miniscoping,[status(esa)],[f98]) ).
fof(f297,plain,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[status(esa)],[f296]) ).
fof(f300,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
inference(cnf_transformation,[status(esa)],[f100]) ).
fof(f428,plain,
ssList(sk1),
inference(cnf_transformation,[status(esa)],[f186]) ).
fof(f432,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f433,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f434,plain,
neq(sk2,nil),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f435,plain,
~ neq(sk1,nil),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f437,plain,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f195]) ).
fof(f438,plain,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f454,plain,
( spl0_4
<=> ssItem(sk5) ),
introduced(split_symbol_definition) ).
fof(f457,plain,
( spl0_5
<=> neq(sk4,nil) ),
introduced(split_symbol_definition) ).
fof(f459,plain,
( ~ neq(sk4,nil)
| spl0_5 ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f437,f454,f457]) ).
fof(f461,plain,
( spl0_6
<=> cons(sk5,nil) = sk3 ),
introduced(split_symbol_definition) ).
fof(f462,plain,
( cons(sk5,nil) = sk3
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( spl0_6
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f438,f461,f457]) ).
fof(f500,plain,
( spl0_8
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f502,plain,
( ~ ssList(nil)
| spl0_8 ),
inference(component_clause,[status(thm)],[f500]) ).
fof(f503,plain,
( spl0_9
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f505,plain,
( ~ ssList(sk1)
| spl0_9 ),
inference(component_clause,[status(thm)],[f503]) ).
fof(f506,plain,
( spl0_10
<=> sk1 = nil ),
introduced(split_symbol_definition) ).
fof(f507,plain,
( sk1 = nil
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f506]) ).
fof(f509,plain,
( ~ ssList(nil)
| ~ ssList(sk1)
| sk1 = nil ),
inference(resolution,[status(thm)],[f300,f435]) ).
fof(f510,plain,
( ~ spl0_8
| ~ spl0_9
| spl0_10 ),
inference(split_clause,[status(thm)],[f509,f500,f503,f506]) ).
fof(f511,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f505,f428]) ).
fof(f512,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f511]) ).
fof(f513,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f502,f205]) ).
fof(f514,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f513]) ).
fof(f525,plain,
( nil = sk3
| ~ spl0_10 ),
inference(backward_demodulation,[status(thm)],[f507,f433]) ).
fof(f527,plain,
( ~ neq(sk2,nil)
| spl0_5 ),
inference(forward_demodulation,[status(thm)],[f432,f459]) ).
fof(f528,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f527,f434]) ).
fof(f529,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f528]) ).
fof(f530,plain,
( cons(sk5,nil) = nil
| ~ spl0_10
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f525,f462]) ).
fof(f540,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ~ spl0_10
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f530,f297]) ).
fof(f541,plain,
( ~ spl0_4
| ~ spl0_8
| ~ spl0_10
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f540,f454,f500,f506,f461]) ).
fof(f555,plain,
$false,
inference(sat_refutation,[status(thm)],[f460,f464,f510,f512,f514,f529,f541]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC217-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.33 % Computer : n001.cluster.edu
% 0.09/0.33 % Model : x86_64 x86_64
% 0.09/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33 % Memory : 8042.1875MB
% 0.09/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.33 % CPULimit : 300
% 0.09/0.33 % WCLimit : 300
% 0.09/0.33 % DateTime : Tue May 30 11:55:15 EDT 2023
% 0.09/0.33 % CPUTime :
% 0.09/0.34 % Drodi V3.5.1
% 0.15/0.35 % Refutation found
% 0.15/0.35 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.58 % Elapsed time: 0.030063 seconds
% 0.16/0.58 % CPU time: 0.018939 seconds
% 0.16/0.58 % Memory used: 4.044 MB
%------------------------------------------------------------------------------