TSTP Solution File: SWC279+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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:53 EDT 2023
% Result : Theorem 0.10s 0.34s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC279+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue May 30 11:19:57 EDT 2023
% 0.10/0.33 % CPUTime :
% 0.10/0.34 % Drodi V3.5.1
% 0.10/0.34 % Refutation found
% 0.10/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.34 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.34 fof(f96,conjecture,(
% 0.10/0.34 (! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| (? [Y] :( ssItem(Y)& (? [Z] :( ssList(Z)& (? [X1] :( ssList(X1)& app(app(Z,cons(Y,nil)),X1) = W& (? [X2] :( ssItem(X2)& ( ( ~ leq(Y,X2)& memberP(X1,X2) )| ( ~ leq(X2,Y)& memberP(Z,X2) ) ) ) )) )) )))| (! [X3] :( ssItem(X3)=> (! [X4] :( ssList(X4)=> (! [X5] :( ssList(X5)=> ( app(app(X4,cons(X3,nil)),X5) != U| (! [X6] :( ssItem(X6)=> ( ( ~ memberP(X4,X6)| leq(X6,X3) )& ( ~ memberP(X5,X6)| leq(X3,X6) ) ) ) )) ) )) )) )) ) )) )) )) )),
% 0.10/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.34 fof(f97,negated_conjecture,(
% 0.10/0.34 ~((! [U] :( ssList(U)=> (! [V] :( ssList(V)=> (! [W] :( ssList(W)=> (! [X] :( ssList(X)=> ( V != X| U != W| (? [Y] :( ssItem(Y)& (? [Z] :( ssList(Z)& (? [X1] :( ssList(X1)& app(app(Z,cons(Y,nil)),X1) = W& (? [X2] :( ssItem(X2)& ( ( ~ leq(Y,X2)& memberP(X1,X2) )| ( ~ leq(X2,Y)& memberP(Z,X2) ) ) ) )) )) )))| (! [X3] :( ssItem(X3)=> (! [X4] :( ssList(X4)=> (! [X5] :( ssList(X5)=> ( app(app(X4,cons(X3,nil)),X5) != U| (! [X6] :( ssItem(X6)=> ( ( ~ memberP(X4,X6)| leq(X6,X3) )& ( ~ memberP(X5,X6)| leq(X3,X6) ) ) ) )) ) )) )) )) ) )) )) )) ))),
% 0.10/0.34 inference(negated_conjecture,[status(cth)],[f96])).
% 0.10/0.34 fof(f415,plain,(
% 0.10/0.34 (?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&(((V=X&U=W)&(![Y]: (~ssItem(Y)|(![Z]: (~ssList(Z)|(![X1]: ((~ssList(X1)|~app(app(Z,cons(Y,nil)),X1)=W)|(![X2]: (~ssItem(X2)|((leq(Y,X2)|~memberP(X1,X2))&(leq(X2,Y)|~memberP(Z,X2))))))))))))&(?[X3]: (ssItem(X3)&(?[X4]: (ssList(X4)&(?[X5]: (ssList(X5)&(app(app(X4,cons(X3,nil)),X5)=U&(?[X6]: (ssItem(X6)&((memberP(X4,X6)&~leq(X6,X3))|(memberP(X5,X6)&~leq(X3,X6)))))))))))))))))))))),
% 0.10/0.34 inference(pre_NNF_transformation,[status(esa)],[f97])).
% 0.10/0.34 fof(f416,plain,(
% 0.10/0.34 ![X3,X4,X6]: (pd0_0(X6,X4,X3)=>(memberP(X4,X6)&~leq(X6,X3)))),
% 0.10/0.34 introduced(predicate_definition,[f415])).
% 0.10/0.34 fof(f417,plain,(
% 0.10/0.34 ?[U]: (ssList(U)&(?[V]: (ssList(V)&(?[W]: (ssList(W)&(?[X]: (ssList(X)&(((V=X&U=W)&(![Y]: (~ssItem(Y)|(![Z]: (~ssList(Z)|(![X1]: ((~ssList(X1)|~app(app(Z,cons(Y,nil)),X1)=W)|(![X2]: (~ssItem(X2)|((leq(Y,X2)|~memberP(X1,X2))&(leq(X2,Y)|~memberP(Z,X2))))))))))))&(?[X3]: (ssItem(X3)&(?[X4]: (ssList(X4)&(?[X5]: (ssList(X5)&(app(app(X4,cons(X3,nil)),X5)=U&(?[X6]: (ssItem(X6)&(pd0_0(X6,X4,X3)|(memberP(X5,X6)&~leq(X3,X6))))))))))))))))))))),
% 0.10/0.34 inference(formula_renaming,[status(thm)],[f415,f416])).
% 0.10/0.34 fof(f418,plain,(
% 0.10/0.34 (ssList(sk0_47)&(ssList(sk0_48)&(ssList(sk0_49)&(ssList(sk0_50)&(((sk0_48=sk0_50&sk0_47=sk0_49)&(![Y]: (~ssItem(Y)|(![Z]: (~ssList(Z)|(![X1]: ((~ssList(X1)|~app(app(Z,cons(Y,nil)),X1)=sk0_49)|(![X2]: (~ssItem(X2)|((leq(Y,X2)|~memberP(X1,X2))&(leq(X2,Y)|~memberP(Z,X2))))))))))))&(ssItem(sk0_51)&(ssList(sk0_52)&(ssList(sk0_53)&(app(app(sk0_52,cons(sk0_51,nil)),sk0_53)=sk0_47&(ssItem(sk0_54)&(pd0_0(sk0_54,sk0_52,sk0_51)|(memberP(sk0_53,sk0_54)&~leq(sk0_51,sk0_54)))))))))))))),
% 0.10/0.34 inference(skolemization,[status(esa)],[f417])).
% 0.10/0.34 fof(f424,plain,(
% 0.10/0.34 sk0_47=sk0_49),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f425,plain,(
% 0.10/0.34 ![X0,X1,X2,X3]: (~ssItem(X0)|~ssList(X1)|~ssList(X2)|~app(app(X1,cons(X0,nil)),X2)=sk0_49|~ssItem(X3)|leq(X0,X3)|~memberP(X2,X3))),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f426,plain,(
% 0.10/0.34 ![X0,X1,X2,X3]: (~ssItem(X0)|~ssList(X1)|~ssList(X2)|~app(app(X1,cons(X0,nil)),X2)=sk0_49|~ssItem(X3)|leq(X3,X0)|~memberP(X1,X3))),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f427,plain,(
% 0.10/0.34 ssItem(sk0_51)),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f428,plain,(
% 0.10/0.34 ssList(sk0_52)),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f429,plain,(
% 0.10/0.34 ssList(sk0_53)),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f430,plain,(
% 0.10/0.34 app(app(sk0_52,cons(sk0_51,nil)),sk0_53)=sk0_47),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f431,plain,(
% 0.10/0.34 ssItem(sk0_54)),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f432,plain,(
% 0.10/0.34 pd0_0(sk0_54,sk0_52,sk0_51)|memberP(sk0_53,sk0_54)),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f433,plain,(
% 0.10/0.34 pd0_0(sk0_54,sk0_52,sk0_51)|~leq(sk0_51,sk0_54)),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f418])).
% 0.10/0.34 fof(f434,plain,(
% 0.10/0.34 ![X3,X4,X6]: (~pd0_0(X6,X4,X3)|(memberP(X4,X6)&~leq(X6,X3)))),
% 0.10/0.34 inference(pre_NNF_transformation,[status(esa)],[f416])).
% 0.10/0.34 fof(f435,plain,(
% 0.10/0.34 ![X0,X1,X2]: (~pd0_0(X0,X1,X2)|memberP(X1,X0))),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f434])).
% 0.10/0.34 fof(f436,plain,(
% 0.10/0.34 ![X0,X1,X2]: (~pd0_0(X0,X1,X2)|~leq(X0,X2))),
% 0.10/0.34 inference(cnf_transformation,[status(esa)],[f434])).
% 0.10/0.34 fof(f437,plain,(
% 0.10/0.34 spl0_0 <=> pd0_0(sk0_54,sk0_52,sk0_51)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f438,plain,(
% 0.10/0.34 pd0_0(sk0_54,sk0_52,sk0_51)|~spl0_0),
% 0.10/0.34 inference(component_clause,[status(thm)],[f437])).
% 0.10/0.34 fof(f440,plain,(
% 0.10/0.34 spl0_1 <=> memberP(sk0_53,sk0_54)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f441,plain,(
% 0.10/0.34 memberP(sk0_53,sk0_54)|~spl0_1),
% 0.10/0.34 inference(component_clause,[status(thm)],[f440])).
% 0.10/0.34 fof(f443,plain,(
% 0.10/0.34 spl0_0|spl0_1),
% 0.10/0.34 inference(split_clause,[status(thm)],[f432,f437,f440])).
% 0.10/0.34 fof(f444,plain,(
% 0.10/0.34 spl0_2 <=> leq(sk0_51,sk0_54)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f447,plain,(
% 0.10/0.34 spl0_0|~spl0_2),
% 0.10/0.34 inference(split_clause,[status(thm)],[f433,f437,f444])).
% 0.10/0.34 fof(f480,plain,(
% 0.10/0.34 memberP(sk0_52,sk0_54)|~spl0_0),
% 0.10/0.34 inference(resolution,[status(thm)],[f438,f435])).
% 0.10/0.34 fof(f481,plain,(
% 0.10/0.34 ~leq(sk0_54,sk0_51)|~spl0_0),
% 0.10/0.34 inference(resolution,[status(thm)],[f436,f438])).
% 0.10/0.34 fof(f482,plain,(
% 0.10/0.34 ![X0,X1,X2,X3]: (~ssItem(X0)|~ssList(X1)|~ssList(X2)|~app(app(X1,cons(X0,nil)),X2)=sk0_47|~ssItem(X3)|leq(X0,X3)|~memberP(X2,X3))),
% 0.10/0.34 inference(forward_demodulation,[status(thm)],[f424,f425])).
% 0.10/0.34 fof(f483,plain,(
% 0.10/0.34 spl0_3 <=> ssItem(sk0_51)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f485,plain,(
% 0.10/0.34 ~ssItem(sk0_51)|spl0_3),
% 0.10/0.34 inference(component_clause,[status(thm)],[f483])).
% 0.10/0.34 fof(f486,plain,(
% 0.10/0.34 spl0_4 <=> ssList(sk0_52)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f488,plain,(
% 0.10/0.34 ~ssList(sk0_52)|spl0_4),
% 0.10/0.34 inference(component_clause,[status(thm)],[f486])).
% 0.10/0.34 fof(f489,plain,(
% 0.10/0.34 spl0_5 <=> ssList(sk0_53)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f491,plain,(
% 0.10/0.34 ~ssList(sk0_53)|spl0_5),
% 0.10/0.34 inference(component_clause,[status(thm)],[f489])).
% 0.10/0.34 fof(f492,plain,(
% 0.10/0.34 spl0_6 <=> ~ssItem(X0)|leq(sk0_51,X0)|~memberP(sk0_53,X0)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f493,plain,(
% 0.10/0.34 ![X0]: (~ssItem(X0)|leq(sk0_51,X0)|~memberP(sk0_53,X0)|~spl0_6)),
% 0.10/0.34 inference(component_clause,[status(thm)],[f492])).
% 0.10/0.34 fof(f495,plain,(
% 0.10/0.34 ![X0]: (~ssItem(sk0_51)|~ssList(sk0_52)|~ssList(sk0_53)|~ssItem(X0)|leq(sk0_51,X0)|~memberP(sk0_53,X0))),
% 0.10/0.34 inference(resolution,[status(thm)],[f430,f482])).
% 0.10/0.34 fof(f496,plain,(
% 0.10/0.34 ~spl0_3|~spl0_4|~spl0_5|spl0_6),
% 0.10/0.34 inference(split_clause,[status(thm)],[f495,f483,f486,f489,f492])).
% 0.10/0.34 fof(f502,plain,(
% 0.10/0.34 $false|spl0_5),
% 0.10/0.34 inference(forward_subsumption_resolution,[status(thm)],[f491,f429])).
% 0.10/0.34 fof(f503,plain,(
% 0.10/0.34 spl0_5),
% 0.10/0.34 inference(contradiction_clause,[status(thm)],[f502])).
% 0.10/0.34 fof(f504,plain,(
% 0.10/0.34 $false|spl0_4),
% 0.10/0.34 inference(forward_subsumption_resolution,[status(thm)],[f488,f428])).
% 0.10/0.34 fof(f505,plain,(
% 0.10/0.34 spl0_4),
% 0.10/0.34 inference(contradiction_clause,[status(thm)],[f504])).
% 0.10/0.34 fof(f506,plain,(
% 0.10/0.34 $false|spl0_3),
% 0.10/0.34 inference(forward_subsumption_resolution,[status(thm)],[f485,f427])).
% 0.10/0.34 fof(f507,plain,(
% 0.10/0.34 spl0_3),
% 0.10/0.34 inference(contradiction_clause,[status(thm)],[f506])).
% 0.10/0.34 fof(f508,plain,(
% 0.10/0.34 ![X0,X1,X2,X3]: (~ssItem(X0)|~ssList(X1)|~ssList(X2)|~app(app(X1,cons(X0,nil)),X2)=sk0_47|~ssItem(X3)|leq(X3,X0)|~memberP(X1,X3))),
% 0.10/0.34 inference(forward_demodulation,[status(thm)],[f424,f426])).
% 0.10/0.34 fof(f509,plain,(
% 0.10/0.34 spl0_8 <=> ~ssItem(X0)|leq(X0,sk0_51)|~memberP(sk0_52,X0)),
% 0.10/0.34 introduced(split_symbol_definition)).
% 0.10/0.34 fof(f510,plain,(
% 0.10/0.34 ![X0]: (~ssItem(X0)|leq(X0,sk0_51)|~memberP(sk0_52,X0)|~spl0_8)),
% 0.10/0.34 inference(component_clause,[status(thm)],[f509])).
% 0.10/0.34 fof(f512,plain,(
% 0.10/0.34 ![X0]: (~ssItem(sk0_51)|~ssList(sk0_52)|~ssList(sk0_53)|~ssItem(X0)|leq(X0,sk0_51)|~memberP(sk0_52,X0))),
% 0.10/0.34 inference(resolution,[status(thm)],[f508,f430])).
% 0.10/0.34 fof(f513,plain,(
% 0.10/0.34 ~spl0_3|~spl0_4|~spl0_5|spl0_8),
% 0.17/0.57 inference(split_clause,[status(thm)],[f512,f483,f486,f489,f509])).
% 0.17/0.57 fof(f516,plain,(
% 0.17/0.57 spl0_9 <=> ssItem(sk0_54)),
% 0.17/0.57 introduced(split_symbol_definition)).
% 0.17/0.57 fof(f518,plain,(
% 0.17/0.57 ~ssItem(sk0_54)|spl0_9),
% 0.17/0.57 inference(component_clause,[status(thm)],[f516])).
% 0.17/0.57 fof(f519,plain,(
% 0.17/0.57 spl0_10 <=> leq(sk0_54,sk0_51)),
% 0.17/0.57 introduced(split_symbol_definition)).
% 0.17/0.57 fof(f520,plain,(
% 0.17/0.57 leq(sk0_54,sk0_51)|~spl0_10),
% 0.17/0.57 inference(component_clause,[status(thm)],[f519])).
% 0.17/0.57 fof(f522,plain,(
% 0.17/0.57 ~ssItem(sk0_54)|leq(sk0_54,sk0_51)|~spl0_8|~spl0_0),
% 0.17/0.57 inference(resolution,[status(thm)],[f510,f480])).
% 0.17/0.57 fof(f523,plain,(
% 0.17/0.57 ~spl0_9|spl0_10|~spl0_8|~spl0_0),
% 0.17/0.57 inference(split_clause,[status(thm)],[f522,f516,f519,f509,f437])).
% 0.17/0.57 fof(f524,plain,(
% 0.17/0.57 $false|spl0_9),
% 0.17/0.57 inference(forward_subsumption_resolution,[status(thm)],[f518,f431])).
% 0.17/0.57 fof(f525,plain,(
% 0.17/0.57 spl0_9),
% 0.17/0.57 inference(contradiction_clause,[status(thm)],[f524])).
% 0.17/0.57 fof(f526,plain,(
% 0.17/0.57 $false|~spl0_0|~spl0_10),
% 0.17/0.57 inference(forward_subsumption_resolution,[status(thm)],[f520,f481])).
% 0.17/0.57 fof(f527,plain,(
% 0.17/0.57 ~spl0_0|~spl0_10),
% 0.17/0.57 inference(contradiction_clause,[status(thm)],[f526])).
% 0.17/0.57 fof(f528,plain,(
% 0.17/0.57 ~ssItem(sk0_54)|leq(sk0_51,sk0_54)|~spl0_1|~spl0_6),
% 0.17/0.57 inference(resolution,[status(thm)],[f441,f493])).
% 0.17/0.57 fof(f529,plain,(
% 0.17/0.57 ~spl0_9|spl0_2|~spl0_1|~spl0_6),
% 0.17/0.57 inference(split_clause,[status(thm)],[f528,f516,f444,f440,f492])).
% 0.17/0.57 fof(f530,plain,(
% 0.17/0.57 $false),
% 0.17/0.57 inference(sat_refutation,[status(thm)],[f443,f447,f496,f503,f505,f507,f513,f523,f525,f527,f529])).
% 0.17/0.57 % SZS output end CNFRefutation for theBenchmark.p
% 0.17/0.57 % Elapsed time: 0.030389 seconds
% 0.17/0.57 % CPU time: 0.021252 seconds
% 0.17/0.57 % Memory used: 4.113 MB
%------------------------------------------------------------------------------