TSTP Solution File: FLD067-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : FLD067-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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:07:08 EDT 2023
% Result : Unsatisfiable 0.16s 0.37s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : FLD067-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 11:09:40 EDT 2023
% 0.16/0.31 % CPUTime :
% 0.16/0.32 % Drodi V3.5.1
% 0.16/0.37 % Refutation found
% 0.16/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.37 % SZS output start CNFRefutation for theBenchmark
% 0.16/0.37 fof(f3,axiom,(
% 0.16/0.37 (![X]: (( equalish(add(X,additive_inverse(X)),additive_identity)| ~ defined(X) ) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f12,axiom,(
% 0.16/0.37 (![X]: (( defined(additive_inverse(X))| ~ defined(X) ) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f19,axiom,(
% 0.16/0.37 (![X,Z,Y]: (( less_or_equal(add(X,Z),add(Y,Z))| ~ defined(Z)| ~ less_or_equal(X,Y) ) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f26,axiom,(
% 0.16/0.37 (![Y,Z,X]: (( less_or_equal(Y,Z)| ~ less_or_equal(X,Z)| ~ equalish(X,Y) ) ))),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f28,hypothesis,(
% 0.16/0.37 defined(a) ),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f30,negated_conjecture,(
% 0.16/0.37 less_or_equal(a,b) ),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f31,negated_conjecture,(
% 0.16/0.37 ~ less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
% 0.16/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.16/0.37 fof(f35,plain,(
% 0.16/0.37 ![X0]: (equalish(add(X0,additive_inverse(X0)),additive_identity)|~defined(X0))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f3])).
% 0.16/0.37 fof(f49,plain,(
% 0.16/0.37 ![X0]: (defined(additive_inverse(X0))|~defined(X0))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f12])).
% 0.16/0.37 fof(f59,plain,(
% 0.16/0.37 ![X,Y]: ((![Z]: (less_or_equal(add(X,Z),add(Y,Z))|~defined(Z)))|~less_or_equal(X,Y))),
% 0.16/0.37 inference(miniscoping,[status(esa)],[f19])).
% 0.16/0.37 fof(f60,plain,(
% 0.16/0.37 ![X0,X1,X2]: (less_or_equal(add(X0,X1),add(X2,X1))|~defined(X1)|~less_or_equal(X0,X2))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f59])).
% 0.16/0.37 fof(f71,plain,(
% 0.16/0.37 ![Y,X]: ((![Z]: (less_or_equal(Y,Z)|~less_or_equal(X,Z)))|~equalish(X,Y))),
% 0.16/0.37 inference(miniscoping,[status(esa)],[f26])).
% 0.16/0.37 fof(f72,plain,(
% 0.16/0.37 ![X0,X1,X2]: (less_or_equal(X0,X1)|~less_or_equal(X2,X1)|~equalish(X2,X0))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f71])).
% 0.16/0.37 fof(f74,plain,(
% 0.16/0.37 defined(a)),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f28])).
% 0.16/0.37 fof(f76,plain,(
% 0.16/0.37 less_or_equal(a,b)),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f30])).
% 0.16/0.37 fof(f77,plain,(
% 0.16/0.37 ~less_or_equal(additive_identity,add(b,additive_inverse(a)))),
% 0.16/0.37 inference(cnf_transformation,[status(esa)],[f31])).
% 0.16/0.37 fof(f100,plain,(
% 0.16/0.37 spl0_3 <=> less_or_equal(a,b)),
% 0.16/0.37 introduced(split_symbol_definition)).
% 0.16/0.37 fof(f102,plain,(
% 0.16/0.37 ~less_or_equal(a,b)|spl0_3),
% 0.16/0.37 inference(component_clause,[status(thm)],[f100])).
% 0.16/0.37 fof(f161,plain,(
% 0.16/0.37 ![X0,X1,X2,X3]: (~defined(X0)|~less_or_equal(X1,X2)|less_or_equal(X3,add(X2,X0))|~equalish(add(X1,X0),X3))),
% 0.16/0.37 inference(resolution,[status(thm)],[f60,f72])).
% 0.16/0.37 fof(f280,plain,(
% 0.16/0.37 spl0_25 <=> defined(additive_inverse(a))),
% 0.16/0.37 introduced(split_symbol_definition)).
% 0.16/0.37 fof(f282,plain,(
% 0.16/0.37 ~defined(additive_inverse(a))|spl0_25),
% 0.16/0.37 inference(component_clause,[status(thm)],[f280])).
% 0.16/0.37 fof(f283,plain,(
% 0.16/0.37 spl0_26 <=> ~less_or_equal(X0,b)|~equalish(add(X0,additive_inverse(a)),additive_identity)),
% 0.16/0.37 introduced(split_symbol_definition)).
% 0.16/0.37 fof(f284,plain,(
% 0.16/0.37 ![X0]: (~less_or_equal(X0,b)|~equalish(add(X0,additive_inverse(a)),additive_identity)|~spl0_26)),
% 0.16/0.37 inference(component_clause,[status(thm)],[f283])).
% 0.16/0.37 fof(f286,plain,(
% 0.16/0.37 ![X0]: (~defined(additive_inverse(a))|~less_or_equal(X0,b)|~equalish(add(X0,additive_inverse(a)),additive_identity))),
% 0.16/0.37 inference(resolution,[status(thm)],[f161,f77])).
% 0.16/0.37 fof(f287,plain,(
% 0.16/0.37 ~spl0_25|spl0_26),
% 0.16/0.37 inference(split_clause,[status(thm)],[f286,f280,f283])).
% 0.16/0.37 fof(f291,plain,(
% 0.16/0.37 ~defined(a)|spl0_25),
% 0.16/0.37 inference(resolution,[status(thm)],[f282,f49])).
% 0.16/0.37 fof(f292,plain,(
% 0.16/0.37 $false|spl0_25),
% 0.16/0.37 inference(forward_subsumption_resolution,[status(thm)],[f291,f74])).
% 0.16/0.37 fof(f293,plain,(
% 0.16/0.37 spl0_25),
% 0.16/0.37 inference(contradiction_clause,[status(thm)],[f292])).
% 0.16/0.37 fof(f294,plain,(
% 0.16/0.37 spl0_27 <=> defined(a)),
% 0.16/0.37 introduced(split_symbol_definition)).
% 0.16/0.37 fof(f296,plain,(
% 0.16/0.37 ~defined(a)|spl0_27),
% 0.16/0.37 inference(component_clause,[status(thm)],[f294])).
% 0.16/0.37 fof(f297,plain,(
% 0.16/0.37 ~less_or_equal(a,b)|~defined(a)|~spl0_26),
% 0.16/0.37 inference(resolution,[status(thm)],[f284,f35])).
% 0.16/0.37 fof(f298,plain,(
% 0.16/0.37 ~spl0_3|~spl0_27|~spl0_26),
% 0.16/0.37 inference(split_clause,[status(thm)],[f297,f100,f294,f283])).
% 0.16/0.37 fof(f299,plain,(
% 0.16/0.37 $false|spl0_27),
% 0.16/0.37 inference(forward_subsumption_resolution,[status(thm)],[f296,f74])).
% 0.16/0.37 fof(f300,plain,(
% 0.16/0.37 spl0_27),
% 0.16/0.37 inference(contradiction_clause,[status(thm)],[f299])).
% 0.16/0.37 fof(f301,plain,(
% 0.16/0.37 $false|spl0_3),
% 0.16/0.37 inference(forward_subsumption_resolution,[status(thm)],[f102,f76])).
% 0.16/0.37 fof(f302,plain,(
% 0.16/0.37 spl0_3),
% 0.16/0.37 inference(contradiction_clause,[status(thm)],[f301])).
% 0.16/0.37 fof(f303,plain,(
% 0.16/0.37 $false),
% 0.16/0.37 inference(sat_refutation,[status(thm)],[f287,f293,f298,f300,f302])).
% 0.16/0.37 % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.39 % Elapsed time: 0.073410 seconds
% 0.16/0.39 % CPU time: 0.164837 seconds
% 0.16/0.39 % Memory used: 5.420 MB
%------------------------------------------------------------------------------