TSTP Solution File: SWC328+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:22 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 73 ( 15 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 68 ( 22 ~; 19 |; 16 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f57,axiom,
! [U] :
( ssList(U)
=> segmentP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != W
| V != X
| U != W
| ( segmentP(V,U)
& equalelemsP(U) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != W
| V != X
| U != W
| ( segmentP(V,U)
& equalelemsP(U) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f322,plain,
! [U] :
( ~ ssList(U)
| segmentP(U,nil) ),
inference(pre_NNF_transformation,[status(esa)],[f57]) ).
fof(f323,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f322]) ).
fof(f362,plain,
equalelemsP(nil),
inference(cnf_transformation,[status(esa)],[f74]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = W
& V = X
& U = W
& ( ~ segmentP(V,U)
| ~ equalelemsP(U) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& nil = sk0_49
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ( ~ segmentP(sk0_48,sk0_47)
| ~ equalelemsP(sk0_47) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f418,plain,
ssList(sk0_48),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f421,plain,
nil = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
( ~ segmentP(sk0_48,sk0_47)
| ~ equalelemsP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
( spl0_0
<=> segmentP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f427,plain,
( ~ segmentP(sk0_48,sk0_47)
| spl0_0 ),
inference(component_clause,[status(thm)],[f425]) ).
fof(f428,plain,
( spl0_1
<=> equalelemsP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f430,plain,
( ~ equalelemsP(sk0_47)
| spl0_1 ),
inference(component_clause,[status(thm)],[f428]) ).
fof(f431,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f424,f425,f428]) ).
fof(f464,plain,
sk0_47 = nil,
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f482,plain,
( ~ segmentP(sk0_48,nil)
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f464,f427]) ).
fof(f483,plain,
( ~ ssList(sk0_48)
| spl0_0 ),
inference(resolution,[status(thm)],[f482,f323]) ).
fof(f484,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f483,f418]) ).
fof(f485,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f484]) ).
fof(f486,plain,
( ~ equalelemsP(nil)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f464,f430]) ).
fof(f487,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f362]) ).
fof(f488,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f487]) ).
fof(f489,plain,
$false,
inference(sat_refutation,[status(thm)],[f431,f485,f488]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.36 % Computer : n015.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Apr 30 00:27:47 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.37 % Drodi V3.6.0
% 0.20/0.38 % Refutation found
% 0.20/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.39 % Elapsed time: 0.028129 seconds
% 0.20/0.39 % CPU time: 0.038319 seconds
% 0.20/0.39 % Total memory used: 14.531 MB
% 0.20/0.39 % Net memory used: 14.508 MB
%------------------------------------------------------------------------------