TSTP Solution File: NUM420-1.000 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.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 : Wed May 31 12:29:03 EDT 2023
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 09:49:07 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.12/0.35 % Drodi V3.5.1
% 0.19/0.54 % Refutation found
% 0.19/0.54 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.19/0.54 % SZS output start CNFRefutation for theBenchmark
% 0.19/0.54 fof(f6,axiom,(
% 0.19/0.54 (![X1,X2]: (plus(X1,X2) = plus(X2,X1) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f8,axiom,(
% 0.19/0.54 (![X1]: (plus(n0,X1) = X1 ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f10,axiom,(
% 0.19/0.54 (![X1,X2]: (( X1 != plus(X1,X2)| X2 = n0 ) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f15,axiom,(
% 0.19/0.54 (![X1,X2]: (times(X1,X2) = times(X2,X1) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f16,axiom,(
% 0.19/0.54 (![X1]: (plus(X1,n1) != n0 ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f20,axiom,(
% 0.19/0.54 (![X1]: (times(n1,X1) = X1 ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f30,axiom,(
% 0.19/0.54 (![X1]: (less(n0,plus(X1,n1)) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f52,negated_conjecture,(
% 0.19/0.54 ( ~ less(n0,p__0)| p__0 = plus(s_7(p__0),n1) ) ),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f58,negated_conjecture,(
% 0.19/0.54 (![X8,X9,X22]: (( ~ less(n0,X8)| ~ less(n0,p__0)| ~ less(X8,p__0)| plus(X8,times(X9,p__0)) != plus(n0,times(X22,p__0)) ) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f68,negated_conjecture,(
% 0.19/0.54 ( ~ less(plus(n0,n1),p__0)| less(n0,p__0) ) ),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f78,negated_conjecture,(
% 0.19/0.54 (![X7]: (( X7 != p__0| less(n1,X7) ) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f82,negated_conjecture,(
% 0.19/0.54 (![X10]: (( X10 = n1| times(s_1(X10),s_4(X10)) = X10 ) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f87,negated_conjecture,(
% 0.19/0.54 (![X10]: (( X10 = n1| s_1(X10) = p__0 ) ))),
% 0.19/0.54 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.19/0.54 fof(f99,plain,(
% 0.19/0.54 ![X0,X1]: (plus(X0,X1)=plus(X1,X0))),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f6])).
% 0.19/0.54 fof(f102,plain,(
% 0.19/0.54 ![X0]: (plus(n0,X0)=X0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f8])).
% 0.19/0.54 fof(f105,plain,(
% 0.19/0.54 ![X2]: ((![X1]: ~X1=plus(X1,X2))|X2=n0)),
% 0.19/0.54 inference(miniscoping,[status(esa)],[f10])).
% 0.19/0.54 fof(f106,plain,(
% 0.19/0.54 ![X0,X1]: (~X0=plus(X0,X1)|X1=n0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f105])).
% 0.19/0.54 fof(f114,plain,(
% 0.19/0.54 ![X0,X1]: (times(X0,X1)=times(X1,X0))),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f15])).
% 0.19/0.54 fof(f115,plain,(
% 0.19/0.54 ![X0]: (~plus(X0,n1)=n0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f16])).
% 0.19/0.54 fof(f119,plain,(
% 0.19/0.54 ![X0]: (times(n1,X0)=X0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f20])).
% 0.19/0.54 fof(f132,plain,(
% 0.19/0.54 ![X0]: (less(n0,plus(X0,n1)))),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f30])).
% 0.19/0.54 fof(f156,plain,(
% 0.19/0.54 ~less(n0,p__0)|p__0=plus(s_7(p__0),n1)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f52])).
% 0.19/0.54 fof(f164,plain,(
% 0.19/0.54 ![X8]: (((~less(n0,X8)|~less(n0,p__0))|~less(X8,p__0))|(![X9,X22]: ~plus(X8,times(X9,p__0))=plus(n0,times(X22,p__0))))),
% 0.19/0.54 inference(miniscoping,[status(esa)],[f58])).
% 0.19/0.54 fof(f165,plain,(
% 0.19/0.54 ![X0,X1,X2]: (~less(n0,X0)|~less(n0,p__0)|~less(X0,p__0)|~plus(X0,times(X1,p__0))=plus(n0,times(X2,p__0)))),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f164])).
% 0.19/0.54 fof(f177,plain,(
% 0.19/0.54 ~less(plus(n0,n1),p__0)|less(n0,p__0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f68])).
% 0.19/0.54 fof(f188,plain,(
% 0.19/0.54 ![X0]: (~X0=p__0|less(n1,X0))),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f78])).
% 0.19/0.54 fof(f193,plain,(
% 0.19/0.54 ![X0]: (X0=n1|times(s_1(X0),s_4(X0))=X0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f82])).
% 0.19/0.54 fof(f198,plain,(
% 0.19/0.54 ![X0]: (X0=n1|s_1(X0)=p__0)),
% 0.19/0.54 inference(cnf_transformation,[status(esa)],[f87])).
% 0.19/0.54 fof(f205,plain,(
% 0.19/0.54 spl0_0 <=> less(n0,p__0)),
% 0.19/0.54 introduced(split_symbol_definition)).
% 0.19/0.54 fof(f224,plain,(
% 0.19/0.54 spl0_5 <=> p__0=plus(s_7(p__0),n1)),
% 0.19/0.54 introduced(split_symbol_definition)).
% 0.19/0.54 fof(f225,plain,(
% 0.19/0.54 p__0=plus(s_7(p__0),n1)|~spl0_5),
% 0.19/0.54 inference(component_clause,[status(thm)],[f224])).
% 0.19/0.54 fof(f227,plain,(
% 0.19/0.54 ~spl0_0|spl0_5),
% 0.19/0.54 inference(split_clause,[status(thm)],[f156,f205,f224])).
% 0.19/0.54 fof(f236,plain,(
% 0.19/0.54 spl0_8 <=> ~less(n0,X0)|~less(X0,p__0)|~plus(X0,times(X1,p__0))=plus(n0,times(X2,p__0))),
% 0.19/0.56 introduced(split_symbol_definition)).
% 0.19/0.56 fof(f237,plain,(
% 0.19/0.56 ![X0,X1,X2]: (~less(n0,X0)|~less(X0,p__0)|~plus(X0,times(X1,p__0))=plus(n0,times(X2,p__0))|~spl0_8)),
% 0.19/0.56 inference(component_clause,[status(thm)],[f236])).
% 0.19/0.56 fof(f239,plain,(
% 0.19/0.56 spl0_8|~spl0_0),
% 0.19/0.56 inference(split_clause,[status(thm)],[f165,f236,f205])).
% 0.19/0.56 fof(f256,plain,(
% 0.19/0.56 spl0_13 <=> less(plus(n0,n1),p__0)),
% 0.19/0.56 introduced(split_symbol_definition)).
% 0.19/0.56 fof(f258,plain,(
% 0.19/0.56 ~less(plus(n0,n1),p__0)|spl0_13),
% 0.19/0.56 inference(component_clause,[status(thm)],[f256])).
% 0.19/0.56 fof(f259,plain,(
% 0.19/0.56 ~spl0_13|spl0_0),
% 0.19/0.56 inference(split_clause,[status(thm)],[f177,f256,f205])).
% 0.19/0.56 fof(f274,plain,(
% 0.19/0.56 less(n1,p__0)),
% 0.19/0.56 inference(destructive_equality_resolution,[status(esa)],[f188])).
% 0.19/0.56 fof(f313,plain,(
% 0.19/0.56 ![X0]: (~plus(n1,X0)=n0)),
% 0.19/0.56 inference(paramodulation,[status(thm)],[f99,f115])).
% 0.19/0.56 fof(f459,plain,(
% 0.19/0.56 less(n0,n1)),
% 0.19/0.56 inference(paramodulation,[status(thm)],[f102,f132])).
% 0.19/0.56 fof(f502,plain,(
% 0.19/0.56 ~less(n1,p__0)|spl0_13),
% 0.19/0.56 inference(forward_demodulation,[status(thm)],[f102,f258])).
% 0.19/0.56 fof(f503,plain,(
% 0.19/0.56 $false|spl0_13),
% 0.19/0.56 inference(forward_subsumption_resolution,[status(thm)],[f502,f274])).
% 0.19/0.56 fof(f504,plain,(
% 0.19/0.56 spl0_13),
% 0.19/0.56 inference(contradiction_clause,[status(thm)],[f503])).
% 0.19/0.56 fof(f508,plain,(
% 0.19/0.56 p__0=plus(n1,s_7(p__0))|~spl0_5),
% 0.19/0.56 inference(forward_demodulation,[status(thm)],[f99,f225])).
% 0.19/0.56 fof(f511,plain,(
% 0.19/0.56 ![X0,X1,X2]: (~less(n0,X0)|~less(X0,p__0)|~plus(X0,times(X1,p__0))=times(X2,p__0)|~spl0_8)),
% 0.19/0.56 inference(forward_demodulation,[status(thm)],[f102,f237])).
% 0.19/0.56 fof(f529,plain,(
% 0.19/0.56 ~p__0=n0|~spl0_5),
% 0.19/0.56 inference(paramodulation,[status(thm)],[f508,f313])).
% 0.19/0.56 fof(f539,plain,(
% 0.19/0.56 ![X0]: (~X0=plus(X0,p__0)|~spl0_5)),
% 0.19/0.56 inference(resolution,[status(thm)],[f529,f106])).
% 0.19/0.56 fof(f719,plain,(
% 0.19/0.56 spl0_29 <=> less(n0,n1)),
% 0.19/0.56 introduced(split_symbol_definition)).
% 0.19/0.56 fof(f721,plain,(
% 0.19/0.56 ~less(n0,n1)|spl0_29),
% 0.19/0.56 inference(component_clause,[status(thm)],[f719])).
% 0.19/0.56 fof(f722,plain,(
% 0.19/0.56 spl0_30 <=> ~plus(n1,times(X0,p__0))=times(X1,p__0)),
% 0.19/0.56 introduced(split_symbol_definition)).
% 0.19/0.56 fof(f723,plain,(
% 0.19/0.56 ![X0,X1]: (~plus(n1,times(X0,p__0))=times(X1,p__0)|~spl0_30)),
% 0.19/0.56 inference(component_clause,[status(thm)],[f722])).
% 0.19/0.56 fof(f725,plain,(
% 0.19/0.56 ![X0,X1]: (~less(n0,n1)|~plus(n1,times(X0,p__0))=times(X1,p__0)|~spl0_8)),
% 0.19/0.56 inference(resolution,[status(thm)],[f511,f274])).
% 0.19/0.56 fof(f726,plain,(
% 0.19/0.56 ~spl0_29|spl0_30|~spl0_8),
% 0.19/0.56 inference(split_clause,[status(thm)],[f725,f719,f722,f236])).
% 0.19/0.56 fof(f1080,plain,(
% 0.19/0.56 $false|spl0_29),
% 0.19/0.56 inference(forward_subsumption_resolution,[status(thm)],[f721,f459])).
% 0.19/0.56 fof(f1081,plain,(
% 0.19/0.56 spl0_29),
% 0.19/0.56 inference(contradiction_clause,[status(thm)],[f1080])).
% 0.19/0.56 fof(f1182,plain,(
% 0.19/0.56 ![X0]: (~plus(n1,p__0)=times(X0,p__0)|~spl0_30)),
% 0.19/0.56 inference(paramodulation,[status(thm)],[f119,f723])).
% 0.19/0.56 fof(f1193,plain,(
% 0.19/0.56 ![X0]: (~plus(n1,p__0)=times(p__0,X0)|~spl0_30)),
% 0.19/0.56 inference(paramodulation,[status(thm)],[f114,f1182])).
% 0.19/0.56 fof(f1484,plain,(
% 0.19/0.56 ![X0]: (X0=n1|times(p__0,s_4(X0))=X0|X0=n1)),
% 0.19/0.56 inference(paramodulation,[status(thm)],[f198,f193])).
% 0.19/0.56 fof(f1485,plain,(
% 0.19/0.56 ![X0]: (X0=n1|times(p__0,s_4(X0))=X0)),
% 0.19/0.56 inference(duplicate_literals_removal,[status(esa)],[f1484])).
% 0.19/0.56 fof(f1499,plain,(
% 0.19/0.56 plus(n1,p__0)=n1|~spl0_30),
% 0.19/0.56 inference(resolution,[status(thm)],[f1485,f1193])).
% 0.19/0.56 fof(f1500,plain,(
% 0.19/0.56 $false|~spl0_5|~spl0_30),
% 0.19/0.56 inference(forward_subsumption_resolution,[status(thm)],[f1499,f539])).
% 0.19/0.56 fof(f1501,plain,(
% 0.19/0.56 ~spl0_5|~spl0_30),
% 0.19/0.56 inference(contradiction_clause,[status(thm)],[f1500])).
% 0.19/0.56 fof(f1502,plain,(
% 0.19/0.56 $false),
% 0.19/0.56 inference(sat_refutation,[status(thm)],[f227,f239,f259,f504,f726,f1081,f1501])).
% 0.19/0.56 % SZS output end CNFRefutation for theBenchmark.p
% 1.06/0.58 % Elapsed time: 0.233229 seconds
% 1.06/0.58 % CPU time: 1.100260 seconds
% 1.06/0.58 % Memory used: 70.193 MB
%------------------------------------------------------------------------------