TSTP Solution File: SWC365+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC365+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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:30 EDT 2024
% Result : Theorem 0.13s 0.31s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 81 ( 18 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 88 ( 29 ~; 25 |; 24 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 12 ( 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ neq(V,nil)
| rearsegP(V,U)
| ( nil != W
& nil = X )
| ( neq(X,nil)
& ( ~ neq(W,nil)
| ~ rearsegP(X,W) ) ) ) ) ) ) ),
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(V,nil)
| rearsegP(V,U)
| ( nil != W
& nil = X )
| ( neq(X,nil)
& ( ~ neq(W,nil)
| ~ rearsegP(X,W) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& neq(V,nil)
& ~ rearsegP(V,U)
& ( nil = W
| nil != X )
& ( ~ neq(X,nil)
| ( neq(W,nil)
& rearsegP(X,W) ) ) ) ) ) ),
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_48,nil)
& ~ rearsegP(sk0_48,sk0_47)
& ( nil = sk0_49
| nil != sk0_50 )
& ( ~ neq(sk0_50,nil)
| ( neq(sk0_49,nil)
& rearsegP(sk0_50,sk0_49) ) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f421,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f422,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
neq(sk0_48,nil),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
~ rearsegP(sk0_48,sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( ~ neq(sk0_50,nil)
| rearsegP(sk0_50,sk0_49) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f435,plain,
( spl0_2
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f437,plain,
( ~ neq(sk0_50,nil)
| spl0_2 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f442,plain,
( spl0_4
<=> rearsegP(sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f443,plain,
( rearsegP(sk0_50,sk0_49)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f442]) ).
fof(f445,plain,
( ~ spl0_2
| spl0_4 ),
inference(split_clause,[status(thm)],[f427,f435,f442]) ).
fof(f491,plain,
( ~ neq(sk0_48,nil)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f421,f437]) ).
fof(f492,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f491,f423]) ).
fof(f493,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f492]) ).
fof(f495,plain,
( rearsegP(sk0_48,sk0_49)
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f421,f443]) ).
fof(f496,plain,
( rearsegP(sk0_48,sk0_47)
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f422,f495]) ).
fof(f497,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f496,f424]) ).
fof(f498,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f497]) ).
fof(f499,plain,
$false,
inference(sat_refutation,[status(thm)],[f445,f493,f498]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC365+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 30 00:26:25 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.6.0
% 0.13/0.31 % Refutation found
% 0.13/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.33 % Elapsed time: 0.022457 seconds
% 0.13/0.33 % CPU time: 0.030704 seconds
% 0.13/0.33 % Total memory used: 14.554 MB
% 0.13/0.33 % Net memory used: 14.531 MB
%------------------------------------------------------------------------------