TSTP Solution File: SWC255-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC255-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:45:05 EDT 2024
% Result : Unsatisfiable 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 52 ( 12 unt; 0 def)
% Number of atoms : 111 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 112 ( 53 ~; 52 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 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(f100,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| V = 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(f187,negated_conjecture,
ssList(sk2),
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,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f197,negated_conjecture,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f205,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f300,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
inference(cnf_transformation,[status(esa)],[f100]) ).
fof(f318,plain,
! [U] :
( ! [V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V) )
| ~ ssList(U) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f319,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f318]) ).
fof(f429,plain,
ssList(sk2),
inference(cnf_transformation,[status(esa)],[f187]) ).
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)
| neq(sk2,nil) ),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f438,plain,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f439,plain,
( ~ singletonP(sk1)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[status(esa)],[f197]) ).
fof(f447,plain,
( spl0_2
<=> neq(sk2,nil) ),
introduced(split_symbol_definition) ).
fof(f448,plain,
( neq(sk2,nil)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f447]) ).
fof(f450,plain,
spl0_2,
inference(split_clause,[status(thm)],[f434,f447]) ).
fof(f451,plain,
( spl0_3
<=> neq(sk4,nil) ),
introduced(split_symbol_definition) ).
fof(f453,plain,
( ~ neq(sk4,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f451]) ).
fof(f455,plain,
( spl0_4
<=> singletonP(sk3) ),
introduced(split_symbol_definition) ).
fof(f456,plain,
( singletonP(sk3)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f455]) ).
fof(f459,plain,
( spl0_5
<=> singletonP(sk1) ),
introduced(split_symbol_definition) ).
fof(f461,plain,
( ~ singletonP(sk1)
| spl0_5 ),
inference(component_clause,[status(thm)],[f459]) ).
fof(f463,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f438,f455,f451]) ).
fof(f464,plain,
( ~ spl0_5
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f439,f459,f451]) ).
fof(f472,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f319]) ).
fof(f473,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f472]) ).
fof(f496,plain,
( ~ neq(sk2,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f432,f453]) ).
fof(f503,plain,
( spl0_8
<=> sk2 = nil ),
introduced(split_symbol_definition) ).
fof(f504,plain,
( sk2 = nil
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f503]) ).
fof(f508,plain,
( spl0_9
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f510,plain,
( ~ ssList(nil)
| spl0_9 ),
inference(component_clause,[status(thm)],[f508]) ).
fof(f511,plain,
( spl0_10
<=> ssList(sk2) ),
introduced(split_symbol_definition) ).
fof(f513,plain,
( ~ ssList(sk2)
| spl0_10 ),
inference(component_clause,[status(thm)],[f511]) ).
fof(f514,plain,
( ~ ssList(nil)
| ~ ssList(sk2)
| sk2 = nil
| spl0_3 ),
inference(resolution,[status(thm)],[f496,f300]) ).
fof(f515,plain,
( ~ spl0_9
| ~ spl0_10
| spl0_8
| spl0_3 ),
inference(split_clause,[status(thm)],[f514,f508,f511,f503,f451]) ).
fof(f516,plain,
( $false
| spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f513,f429]) ).
fof(f517,plain,
spl0_10,
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f518,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f510,f205]) ).
fof(f519,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f518]) ).
fof(f520,plain,
( singletonP(sk1)
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f433,f456]) ).
fof(f521,plain,
( $false
| spl0_5
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f520,f461]) ).
fof(f522,plain,
( spl0_5
| ~ spl0_4 ),
inference(contradiction_clause,[status(thm)],[f521]) ).
fof(f525,plain,
( neq(nil,nil)
| ~ spl0_8
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f504,f448]) ).
fof(f527,plain,
( ~ ssList(nil)
| ~ spl0_8
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f525,f473]) ).
fof(f528,plain,
( ~ spl0_9
| ~ spl0_8
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f527,f508,f503,f447]) ).
fof(f529,plain,
$false,
inference(sat_refutation,[status(thm)],[f450,f463,f464,f515,f517,f519,f522,f528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC255-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 : Mon Apr 29 23:54:03 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.026962 seconds
% 0.14/0.39 % CPU time: 0.041101 seconds
% 0.14/0.39 % Total memory used: 14.266 MB
% 0.14/0.39 % Net memory used: 14.245 MB
%------------------------------------------------------------------------------