TSTP Solution File: SWC102+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC102+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:15 EDT 2023
% Result : Theorem 0.11s 0.28s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 77 ( 17 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 72 ( 23 ~; 20 |; 18 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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(f42,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| X != W
| ~ neq(V,nil)
| ( neq(U,nil)
& frontsegP(V,U) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| X != W
| ~ neq(V,nil)
| ( neq(U,nil)
& frontsegP(V,U) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f285,plain,
! [U] :
( ~ ssList(U)
| frontsegP(U,U) ),
inference(pre_NNF_transformation,[status(esa)],[f42]) ).
fof(f286,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f285]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& X = W
& neq(V,nil)
& ( ~ neq(U,nil)
| ~ frontsegP(V,U) ) ) ) ) ),
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
& sk0_50 = sk0_49
& neq(sk0_48,nil)
& ( ~ neq(sk0_47,nil)
| ~ frontsegP(sk0_48,sk0_47) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f417,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
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,
sk0_50 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
neq(sk0_48,nil),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
( ~ neq(sk0_47,nil)
| ~ frontsegP(sk0_48,sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( spl0_0
<=> neq(sk0_47,nil) ),
introduced(split_symbol_definition) ).
fof(f428,plain,
( ~ neq(sk0_47,nil)
| spl0_0 ),
inference(component_clause,[status(thm)],[f426]) ).
fof(f429,plain,
( spl0_1
<=> frontsegP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f431,plain,
( ~ frontsegP(sk0_48,sk0_47)
| spl0_1 ),
inference(component_clause,[status(thm)],[f429]) ).
fof(f432,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f425,f426,f429]) ).
fof(f465,plain,
sk0_48 = sk0_49,
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f466,plain,
sk0_48 = sk0_47,
inference(forward_demodulation,[status(thm)],[f422,f465]) ).
fof(f469,plain,
neq(sk0_47,nil),
inference(forward_demodulation,[status(thm)],[f466,f424]) ).
fof(f482,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f428,f469]) ).
fof(f483,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f482]) ).
fof(f484,plain,
( ~ frontsegP(sk0_47,sk0_47)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f466,f431]) ).
fof(f485,plain,
( ~ ssList(sk0_47)
| spl0_1 ),
inference(resolution,[status(thm)],[f484,f286]) ).
fof(f486,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f485,f417]) ).
fof(f487,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f486]) ).
fof(f488,plain,
$false,
inference(sat_refutation,[status(thm)],[f432,f483,f487]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n007.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 30 11:10:01 EDT 2023
% 0.07/0.26 % CPUTime :
% 0.11/0.27 % Drodi V3.5.1
% 0.11/0.28 % Refutation found
% 0.11/0.28 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.28 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.28 % Elapsed time: 0.017547 seconds
% 0.11/0.28 % CPU time: 0.027679 seconds
% 0.11/0.28 % Memory used: 16.071 MB
%------------------------------------------------------------------------------