TSTP Solution File: SWC131+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC131+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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:23 EDT 2023
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 89 ( 17 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 89 ( 33 ~; 26 |; 15 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 (; 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| neq(X,nil)
| cyclefreeP(V) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| neq(X,nil)
| cyclefreeP(V) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f217,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( neq(U,V)
<=> U != V ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f218,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ neq(U,V)
| U != V )
& ( neq(U,V)
| U = V ) ) ) ),
inference(NNF_transformation,[status(esa)],[f217]) ).
fof(f220,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f218]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f330,plain,
cyclefreeP(nil),
inference(cnf_transformation,[status(esa)],[f60]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ neq(X,nil)
& ~ cyclefreeP(V) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ~ neq(sk0_50,nil)
& ~ cyclefreeP(sk0_48) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f418,plain,
ssList(sk0_48),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f421,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
~ neq(sk0_50,nil),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
~ cyclefreeP(sk0_48),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f457,plain,
~ neq(sk0_48,nil),
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f464,plain,
( spl0_2
<=> sk0_48 = nil ),
introduced(split_symbol_definition) ).
fof(f465,plain,
( sk0_48 = nil
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f464]) ).
fof(f469,plain,
( spl0_3
<=> ssList(sk0_48) ),
introduced(split_symbol_definition) ).
fof(f471,plain,
( ~ ssList(sk0_48)
| spl0_3 ),
inference(component_clause,[status(thm)],[f469]) ).
fof(f472,plain,
( spl0_4
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f474,plain,
( ~ ssList(nil)
| spl0_4 ),
inference(component_clause,[status(thm)],[f472]) ).
fof(f475,plain,
( ~ ssList(sk0_48)
| ~ ssList(nil)
| sk0_48 = nil ),
inference(resolution,[status(thm)],[f220,f457]) ).
fof(f476,plain,
( ~ spl0_3
| ~ spl0_4
| spl0_2 ),
inference(split_clause,[status(thm)],[f475,f469,f472,f464]) ).
fof(f477,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f474,f223]) ).
fof(f478,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f477]) ).
fof(f479,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f471,f418]) ).
fof(f480,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f479]) ).
fof(f482,plain,
( ~ cyclefreeP(nil)
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f465,f424]) ).
fof(f483,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f330]) ).
fof(f484,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f483]) ).
fof(f485,plain,
$false,
inference(sat_refutation,[status(thm)],[f476,f478,f480,f484]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC131+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 11:12:47 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.12/0.37 % Refutation found
% 0.12/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.37 % Elapsed time: 0.028263 seconds
% 0.12/0.37 % CPU time: 0.031939 seconds
% 0.12/0.37 % Memory used: 4.059 MB
%------------------------------------------------------------------------------