TSTP Solution File: SWC275+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n020.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:52 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 62 ( 13 unt; 0 def)
% Number of atoms : 172 ( 42 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 178 ( 68 ~; 65 |; 25 &)
% ( 11 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 26 (; 21 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f65,axiom,
! [U] :
( ssItem(U)
=> totalorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f66,axiom,
totalorderedP(nil),
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
| totalorderedP(U)
| ( nil != W
& nil = X )
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& neq(X,nil) ) ) ) ) ),
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
| totalorderedP(U)
| ( nil != W
& nil = X )
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& neq(X,nil) ) ) ) ) ),
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(f337,plain,
! [U] :
( ~ ssItem(U)
| totalorderedP(cons(U,nil)) ),
inference(pre_NNF_transformation,[status(esa)],[f65]) ).
fof(f338,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[status(esa)],[f337]) ).
fof(f339,plain,
totalorderedP(nil),
inference(cnf_transformation,[status(esa)],[f66]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ totalorderedP(U)
& ( nil = W
| nil != X )
& ( ? [Y] :
( ssItem(Y)
& cons(Y,nil) = W
& memberP(X,Y) )
| ~ neq(X,nil) ) ) ) ) ),
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
& ~ totalorderedP(sk0_47)
& ( nil = sk0_49
| nil != sk0_50 )
& ( ( ssItem(sk0_51)
& cons(sk0_51,nil) = sk0_49
& memberP(sk0_50,sk0_51) )
| ~ neq(sk0_50,nil) ) ),
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(f422,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
~ totalorderedP(sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
( nil = sk0_49
| nil != sk0_50 ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
( ssItem(sk0_51)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( cons(sk0_51,nil) = sk0_49
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
( spl0_0
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f429,plain,
( nil = sk0_49
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f428]) ).
fof(f431,plain,
( spl0_1
<=> nil = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f433,plain,
( nil != sk0_50
| spl0_1 ),
inference(component_clause,[status(thm)],[f431]) ).
fof(f434,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f424,f428,f431]) ).
fof(f435,plain,
( spl0_2
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f438,plain,
( spl0_3
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f440,plain,
( ~ neq(sk0_50,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f425,f435,f438]) ).
fof(f442,plain,
( spl0_4
<=> cons(sk0_51,nil) = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f443,plain,
( cons(sk0_51,nil) = sk0_49
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f442]) ).
fof(f445,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f426,f442,f438]) ).
fof(f482,plain,
( nil != sk0_48
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f421,f433]) ).
fof(f483,plain,
( ~ neq(sk0_48,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f421,f440]) ).
fof(f484,plain,
( spl0_6
<=> ssList(sk0_48) ),
introduced(split_symbol_definition) ).
fof(f486,plain,
( ~ ssList(sk0_48)
| spl0_6 ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f487,plain,
( spl0_7
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f489,plain,
( ~ ssList(nil)
| spl0_7 ),
inference(component_clause,[status(thm)],[f487]) ).
fof(f490,plain,
( spl0_8
<=> sk0_48 = nil ),
introduced(split_symbol_definition) ).
fof(f491,plain,
( sk0_48 = nil
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f490]) ).
fof(f493,plain,
( ~ ssList(sk0_48)
| ~ ssList(nil)
| sk0_48 = nil
| spl0_3 ),
inference(resolution,[status(thm)],[f483,f220]) ).
fof(f494,plain,
( ~ spl0_6
| ~ spl0_7
| spl0_8
| spl0_3 ),
inference(split_clause,[status(thm)],[f493,f484,f487,f490,f438]) ).
fof(f503,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f489,f223]) ).
fof(f504,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f503]) ).
fof(f505,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f418]) ).
fof(f506,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f505]) ).
fof(f507,plain,
( cons(sk0_51,nil) = sk0_47
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f422,f443]) ).
fof(f510,plain,
( spl0_11
<=> totalorderedP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f511,plain,
( totalorderedP(sk0_47)
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f510]) ).
fof(f513,plain,
( ~ ssItem(sk0_51)
| totalorderedP(sk0_47)
| ~ spl0_4 ),
inference(paramodulation,[status(thm)],[f507,f338]) ).
fof(f514,plain,
( ~ spl0_2
| spl0_11
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f513,f435,f510,f442]) ).
fof(f535,plain,
( $false
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f511,f423]) ).
fof(f536,plain,
~ spl0_11,
inference(contradiction_clause,[status(thm)],[f535]) ).
fof(f537,plain,
( $false
| spl0_1
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f491,f482]) ).
fof(f538,plain,
( spl0_1
| ~ spl0_8 ),
inference(contradiction_clause,[status(thm)],[f537]) ).
fof(f539,plain,
( nil = sk0_47
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f422,f429]) ).
fof(f541,plain,
( ~ totalorderedP(nil)
| ~ spl0_0 ),
inference(backward_demodulation,[status(thm)],[f539,f423]) ).
fof(f542,plain,
( $false
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f541,f339]) ).
fof(f543,plain,
~ spl0_0,
inference(contradiction_clause,[status(thm)],[f542]) ).
fof(f544,plain,
$false,
inference(sat_refutation,[status(thm)],[f434,f441,f445,f494,f504,f506,f514,f536,f538,f543]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC275+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:20:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.030490 seconds
% 0.13/0.38 % CPU time: 0.049209 seconds
% 0.13/0.38 % Memory used: 16.148 MB
%------------------------------------------------------------------------------