TSTP Solution File: SWC044+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC044+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n010.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:44:18 EDT 2024
% Result : Theorem 0.15s 0.31s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 78 ( 29 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 74 ( 24 ~; 20 |; 17 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 12 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,axiom,
! [U] :
( ssList(U)
=> ( rearsegP(nil,U)
<=> nil = U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| ~ rearsegP(X,W)
| nil = 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 != V
| V != X
| U != W
| ~ rearsegP(X,W)
| nil = U ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f310,plain,
! [U] :
( ~ ssList(U)
| ( rearsegP(nil,U)
<=> nil = U ) ),
inference(pre_NNF_transformation,[status(esa)],[f52]) ).
fof(f311,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ rearsegP(nil,U)
| nil = U )
& ( rearsegP(nil,U)
| nil != U ) ) ),
inference(NNF_transformation,[status(esa)],[f310]) ).
fof(f312,plain,
! [X0] :
( ~ ssList(X0)
| ~ rearsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f311]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = V
& V = X
& U = W
& rearsegP(X,W)
& nil != 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_48
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& rearsegP(sk0_50,sk0_49)
& nil != sk0_47 ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f417,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f421,plain,
nil = sk0_48,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f422,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
rearsegP(sk0_50,sk0_49),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
nil != sk0_47,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f457,plain,
nil = sk0_50,
inference(forward_demodulation,[status(thm)],[f421,f422]) ).
fof(f460,plain,
rearsegP(nil,sk0_49),
inference(forward_demodulation,[status(thm)],[f457,f424]) ).
fof(f461,plain,
rearsegP(nil,sk0_47),
inference(forward_demodulation,[status(thm)],[f423,f460]) ).
fof(f470,plain,
( spl0_2
<=> rearsegP(nil,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f472,plain,
( ~ rearsegP(nil,sk0_47)
| spl0_2 ),
inference(component_clause,[status(thm)],[f470]) ).
fof(f473,plain,
( spl0_3
<=> nil = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f474,plain,
( nil = sk0_47
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f473]) ).
fof(f476,plain,
( ~ rearsegP(nil,sk0_47)
| nil = sk0_47 ),
inference(resolution,[status(thm)],[f312,f417]) ).
fof(f477,plain,
( ~ spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f476,f470,f473]) ).
fof(f478,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f472,f461]) ).
fof(f479,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f478]) ).
fof(f480,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f474,f425]) ).
fof(f481,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f480]) ).
fof(f482,plain,
$false,
inference(sat_refutation,[status(thm)],[f477,f479,f481]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : SWC044+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n010.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 : Mon Apr 29 23:51:35 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.6.0
% 0.15/0.31 % Refutation found
% 0.15/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.32 % Elapsed time: 0.020900 seconds
% 0.15/0.32 % CPU time: 0.030521 seconds
% 0.15/0.32 % Total memory used: 14.494 MB
% 0.15/0.32 % Net memory used: 14.460 MB
%------------------------------------------------------------------------------