TSTP Solution File: SWC256-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC256-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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:06 EDT 2024
% Result : Unsatisfiable 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 53 ( 13 unt; 0 def)
% Number of atoms : 119 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 129 ( 63 ~; 60 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f86,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
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(f116,axiom,
! [U,V] :
( cons(U,nil) != V
| ~ ssItem(U)
| ~ ssList(V)
| singletonP(V) ),
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),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f193,negated_conjecture,
~ singletonP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f194,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f196,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f207,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f286,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[status(esa)],[f86]) ).
fof(f320,plain,
! [U] :
( ! [V] :
( U != V
| ~ neq(U,V)
| ~ ssList(V) )
| ~ ssList(U) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f321,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f320]) ).
fof(f322,plain,
! [V] :
( ! [U] :
( cons(U,nil) != V
| ~ ssItem(U) )
| ~ ssList(V)
| singletonP(V) ),
inference(miniscoping,[status(esa)],[f116]) ).
fof(f323,plain,
! [X0,X1] :
( cons(X0,nil) != X1
| ~ ssItem(X0)
| ~ ssList(X1)
| singletonP(X1) ),
inference(cnf_transformation,[status(esa)],[f322]) ).
fof(f434,plain,
sk2 = sk4,
inference(cnf_transformation,[status(esa)],[f190]) ).
fof(f435,plain,
sk1 = sk3,
inference(cnf_transformation,[status(esa)],[f191]) ).
fof(f436,plain,
neq(sk2,nil),
inference(cnf_transformation,[status(esa)],[f192]) ).
fof(f437,plain,
~ singletonP(sk1),
inference(cnf_transformation,[status(esa)],[f193]) ).
fof(f438,plain,
( ssItem(sk5)
| nil = sk4 ),
inference(cnf_transformation,[status(esa)],[f194]) ).
fof(f440,plain,
( cons(sk5,nil) = sk3
| nil = sk4 ),
inference(cnf_transformation,[status(esa)],[f196]) ).
fof(f451,plain,
( spl0_2
<=> ssItem(sk5) ),
introduced(split_symbol_definition) ).
fof(f454,plain,
( spl0_3
<=> nil = sk4 ),
introduced(split_symbol_definition) ).
fof(f455,plain,
( nil = sk4
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f454]) ).
fof(f457,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f438,f451,f454]) ).
fof(f462,plain,
( spl0_5
<=> cons(sk5,nil) = sk3 ),
introduced(split_symbol_definition) ).
fof(f463,plain,
( cons(sk5,nil) = sk3
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,plain,
( spl0_5
| spl0_3 ),
inference(split_clause,[status(thm)],[f440,f462,f454]) ).
fof(f479,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f321]) ).
fof(f480,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f479]) ).
fof(f481,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(cons(X0,nil))
| singletonP(cons(X0,nil)) ),
inference(destructive_equality_resolution,[status(esa)],[f323]) ).
fof(f507,plain,
( nil = sk2
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f434,f455]) ).
fof(f508,plain,
( neq(nil,nil)
| ~ spl0_3 ),
inference(backward_demodulation,[status(thm)],[f507,f436]) ).
fof(f512,plain,
( ~ ssList(nil)
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f508,f480]) ).
fof(f513,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f512,f207]) ).
fof(f514,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f513]) ).
fof(f515,plain,
( spl0_7
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f517,plain,
( ~ ssList(nil)
| spl0_7 ),
inference(component_clause,[status(thm)],[f515]) ).
fof(f527,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f517,f207]) ).
fof(f528,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f527]) ).
fof(f562,plain,
( cons(sk5,nil) = sk1
| ~ spl0_5 ),
inference(backward_demodulation,[status(thm)],[f435,f463]) ).
fof(f568,plain,
( spl0_11
<=> ssList(sk1) ),
introduced(split_symbol_definition) ).
fof(f587,plain,
( spl0_14
<=> singletonP(cons(sk5,nil)) ),
introduced(split_symbol_definition) ).
fof(f588,plain,
( singletonP(cons(sk5,nil))
| ~ spl0_14 ),
inference(component_clause,[status(thm)],[f587]) ).
fof(f592,plain,
( singletonP(sk1)
| ~ spl0_5
| ~ spl0_14 ),
inference(forward_demodulation,[status(thm)],[f562,f588]) ).
fof(f593,plain,
( $false
| ~ spl0_5
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f592,f437]) ).
fof(f594,plain,
( ~ spl0_5
| ~ spl0_14 ),
inference(contradiction_clause,[status(thm)],[f593]) ).
fof(f604,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(sk1)
| ~ spl0_5 ),
inference(paramodulation,[status(thm)],[f562,f286]) ).
fof(f605,plain,
( ~ spl0_2
| ~ spl0_7
| spl0_11
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f604,f451,f515,f568,f462]) ).
fof(f616,plain,
( ~ ssItem(sk5)
| ~ ssList(sk1)
| singletonP(cons(sk5,nil))
| ~ spl0_5 ),
inference(paramodulation,[status(thm)],[f562,f481]) ).
fof(f617,plain,
( ~ spl0_2
| ~ spl0_11
| spl0_14
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f616,f451,f568,f587,f462]) ).
fof(f618,plain,
$false,
inference(sat_refutation,[status(thm)],[f457,f465,f514,f528,f594,f605,f617]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC256-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 : n011.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:13:31 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.029528 seconds
% 0.14/0.39 % CPU time: 0.049219 seconds
% 0.14/0.39 % Total memory used: 14.434 MB
% 0.14/0.39 % Net memory used: 14.405 MB
%------------------------------------------------------------------------------