TSTP Solution File: SWC007-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC007-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 : Wed May 31 12:38:50 EDT 2023
% Result : Unsatisfiable 0.10s 0.29s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC007-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n023.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 30 11:40:53 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.27 % Drodi V3.5.1
% 0.10/0.29 % Refutation found
% 0.10/0.29 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.29 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.29 fof(f73,axiom,(
% 0.10/0.29 (![U]: (( ~ ssList(U)| app(U,nil) = U ) ))),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f74,axiom,(
% 0.10/0.29 (![U]: (( ~ ssList(U)| app(nil,U) = U ) ))),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f187,negated_conjecture,(
% 0.10/0.29 ssList(sk2) ),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f188,negated_conjecture,(
% 0.10/0.29 ssList(sk3) ),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f190,negated_conjecture,(
% 0.10/0.29 nil = sk3 ),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f192,negated_conjecture,(
% 0.10/0.29 sk1 = sk3 ),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f193,negated_conjecture,(
% 0.10/0.29 (![A,B,C]: (( ~ ssList(A)| ~ ssList(B)| ~ ssList(C)| app(app(A,B),C) != sk2| app(A,C) != sk1 ) ))),
% 0.10/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.29 fof(f267,plain,(
% 0.10/0.29 ![X0]: (~ssList(X0)|app(X0,nil)=X0)),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f73])).
% 0.10/0.29 fof(f268,plain,(
% 0.10/0.29 ![X0]: (~ssList(X0)|app(nil,X0)=X0)),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f74])).
% 0.10/0.29 fof(f425,plain,(
% 0.10/0.29 ssList(sk2)),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f187])).
% 0.10/0.29 fof(f426,plain,(
% 0.10/0.29 ssList(sk3)),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f188])).
% 0.10/0.29 fof(f428,plain,(
% 0.10/0.29 nil=sk3),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f190])).
% 0.10/0.29 fof(f430,plain,(
% 0.10/0.29 sk1=sk3),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f192])).
% 0.10/0.29 fof(f431,plain,(
% 0.10/0.29 ![A,C]: ((![B]: (((~ssList(A)|~ssList(B))|~ssList(C))|~app(app(A,B),C)=sk2))|~app(A,C)=sk1)),
% 0.10/0.29 inference(miniscoping,[status(esa)],[f193])).
% 0.10/0.29 fof(f432,plain,(
% 0.10/0.29 ![X0,X1,X2]: (~ssList(X0)|~ssList(X1)|~ssList(X2)|~app(app(X0,X1),X2)=sk2|~app(X0,X2)=sk1)),
% 0.10/0.29 inference(cnf_transformation,[status(esa)],[f431])).
% 0.10/0.29 fof(f469,plain,(
% 0.10/0.29 ssList(nil)),
% 0.10/0.29 inference(backward_demodulation,[status(thm)],[f428,f426])).
% 0.10/0.29 fof(f471,plain,(
% 0.10/0.29 sk1=nil),
% 0.10/0.29 inference(forward_demodulation,[status(thm)],[f428,f430])).
% 0.10/0.29 fof(f473,plain,(
% 0.10/0.29 ![X0,X1,X2]: (~ssList(X0)|~ssList(X1)|~ssList(X2)|~app(app(X0,X1),X2)=sk2|~app(X0,X2)=nil)),
% 0.10/0.29 inference(backward_demodulation,[status(thm)],[f471,f432])).
% 0.10/0.29 fof(f474,plain,(
% 0.10/0.29 app(nil,nil)=nil),
% 0.10/0.29 inference(resolution,[status(thm)],[f267,f469])).
% 0.10/0.29 fof(f475,plain,(
% 0.10/0.29 app(sk2,nil)=sk2),
% 0.10/0.29 inference(resolution,[status(thm)],[f267,f425])).
% 0.10/0.29 fof(f476,plain,(
% 0.10/0.29 spl0_2 <=> ssList(nil)),
% 0.10/0.29 introduced(split_symbol_definition)).
% 0.10/0.29 fof(f478,plain,(
% 0.10/0.29 ~ssList(nil)|spl0_2),
% 0.10/0.29 inference(component_clause,[status(thm)],[f476])).
% 0.10/0.29 fof(f479,plain,(
% 0.10/0.29 spl0_3 <=> ~ssList(X0)|~app(app(nil,X0),nil)=sk2),
% 0.10/0.29 introduced(split_symbol_definition)).
% 0.10/0.29 fof(f480,plain,(
% 0.10/0.29 ![X0]: (~ssList(X0)|~app(app(nil,X0),nil)=sk2|~spl0_3)),
% 0.10/0.29 inference(component_clause,[status(thm)],[f479])).
% 0.10/0.29 fof(f482,plain,(
% 0.10/0.29 ![X0]: (~ssList(nil)|~ssList(X0)|~ssList(nil)|~app(app(nil,X0),nil)=sk2)),
% 0.10/0.29 inference(resolution,[status(thm)],[f474,f473])).
% 0.10/0.29 fof(f483,plain,(
% 0.10/0.29 ~spl0_2|spl0_3),
% 0.10/0.29 inference(split_clause,[status(thm)],[f482,f476,f479])).
% 0.10/0.29 fof(f489,plain,(
% 0.10/0.29 $false|spl0_2),
% 0.10/0.29 inference(forward_subsumption_resolution,[status(thm)],[f478,f469])).
% 0.10/0.29 fof(f490,plain,(
% 0.10/0.29 spl0_2),
% 0.10/0.29 inference(contradiction_clause,[status(thm)],[f489])).
% 0.10/0.29 fof(f491,plain,(
% 0.10/0.29 spl0_5 <=> ssList(sk2)),
% 0.10/0.29 introduced(split_symbol_definition)).
% 0.10/0.29 fof(f493,plain,(
% 0.10/0.29 ~ssList(sk2)|spl0_5),
% 0.10/0.29 inference(component_clause,[status(thm)],[f491])).
% 0.10/0.29 fof(f508,plain,(
% 0.10/0.29 app(nil,sk2)=sk2),
% 0.10/0.29 inference(resolution,[status(thm)],[f268,f425])).
% 0.10/0.29 fof(f509,plain,(
% 0.10/0.29 spl0_9 <=> app(sk2,nil)=sk2),
% 0.10/0.29 introduced(split_symbol_definition)).
% 0.10/0.29 fof(f511,plain,(
% 0.10/0.29 ~app(sk2,nil)=sk2|spl0_9),
% 0.10/0.29 inference(component_clause,[status(thm)],[f509])).
% 0.10/0.29 fof(f512,plain,(
% 0.10/0.29 ~ssList(sk2)|~app(sk2,nil)=sk2|~spl0_3),
% 0.10/0.29 inference(paramodulation,[status(thm)],[f508,f480])).
% 0.10/0.29 fof(f513,plain,(
% 0.10/0.29 ~spl0_5|~spl0_9|~spl0_3),
% 0.10/0.29 inference(split_clause,[status(thm)],[f512,f491,f509,f479])).
% 0.10/0.29 fof(f519,plain,(
% 0.10/0.29 ~sk2=sk2|spl0_9),
% 0.10/0.29 inference(forward_demodulation,[status(thm)],[f475,f511])).
% 0.10/0.29 fof(f520,plain,(
% 0.10/0.29 $false|spl0_9),
% 0.10/0.29 inference(trivial_equality_resolution,[status(esa)],[f519])).
% 0.10/0.29 fof(f521,plain,(
% 0.10/0.29 spl0_9),
% 0.10/0.29 inference(contradiction_clause,[status(thm)],[f520])).
% 0.10/0.29 fof(f523,plain,(
% 0.10/0.29 $false|spl0_5),
% 0.10/0.29 inference(forward_subsumption_resolution,[status(thm)],[f493,f425])).
% 0.10/0.29 fof(f524,plain,(
% 0.10/0.29 spl0_5),
% 0.10/0.29 inference(contradiction_clause,[status(thm)],[f523])).
% 0.10/0.29 fof(f525,plain,(
% 0.10/0.29 $false),
% 0.10/0.29 inference(sat_refutation,[status(thm)],[f483,f490,f513,f521,f524])).
% 0.10/0.29 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.52 % Elapsed time: 0.043476 seconds
% 0.10/0.52 % CPU time: 0.151826 seconds
% 0.10/0.52 % Memory used: 18.752 MB
%------------------------------------------------------------------------------