TSTP Solution File: FLD003-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : FLD003-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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 : Tue Apr 30 20:16:17 EDT 2024
% Result : Unsatisfiable 0.10s 0.36s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : FLD003-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.09/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n014.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 : Mon Apr 29 23:14:49 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.6.0
% 0.10/0.36 % Refutation found
% 0.10/0.36 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.36 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.36 fof(f2,axiom,(
% 0.10/0.36 (![X]: (( equalish(add(additive_identity,X),X)| ~ defined(X) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f3,axiom,(
% 0.10/0.36 (![X]: (( equalish(add(X,additive_inverse(X)),additive_identity)| ~ defined(X) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f4,axiom,(
% 0.10/0.36 (![X,Y]: (( equalish(add(X,Y),add(Y,X))| ~ defined(X)| ~ defined(Y) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f10,axiom,(
% 0.10/0.36 (![X,Y]: (( defined(add(X,Y))| ~ defined(X)| ~ defined(Y) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f11,axiom,(
% 0.10/0.36 defined(additive_identity) ),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f12,axiom,(
% 0.10/0.36 (![X]: (( defined(additive_inverse(X))| ~ defined(X) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f14,axiom,(
% 0.10/0.36 defined(multiplicative_identity) ),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f23,axiom,(
% 0.10/0.36 (![X,Z,Y]: (( equalish(X,Z)| ~ equalish(X,Y)| ~ equalish(Y,Z) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f24,axiom,(
% 0.10/0.36 (![X,Z,Y]: (( equalish(add(X,Z),add(Y,Z))| ~ defined(Z)| ~ equalish(X,Y) ) ))),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f28,hypothesis,(
% 0.10/0.36 defined(a) ),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f29,hypothesis,(
% 0.10/0.36 defined(b) ),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f30,negated_conjecture,(
% 0.10/0.36 ~ equalish(add(a,add(b,additive_inverse(b))),a) ),
% 0.10/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.36 fof(f33,plain,(
% 0.10/0.36 ![X0]: (equalish(add(additive_identity,X0),X0)|~defined(X0))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f2])).
% 0.10/0.36 fof(f34,plain,(
% 0.10/0.36 ![X0]: (equalish(add(X0,additive_inverse(X0)),additive_identity)|~defined(X0))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f3])).
% 0.10/0.36 fof(f35,plain,(
% 0.10/0.36 ![Y]: ((![X]: (equalish(add(X,Y),add(Y,X))|~defined(X)))|~defined(Y))),
% 0.10/0.36 inference(miniscoping,[status(esa)],[f4])).
% 0.10/0.36 fof(f36,plain,(
% 0.10/0.36 ![X0,X1]: (equalish(add(X0,X1),add(X1,X0))|~defined(X0)|~defined(X1))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f35])).
% 0.10/0.36 fof(f45,plain,(
% 0.10/0.36 ![Y]: ((![X]: (defined(add(X,Y))|~defined(X)))|~defined(Y))),
% 0.10/0.36 inference(miniscoping,[status(esa)],[f10])).
% 0.10/0.36 fof(f46,plain,(
% 0.10/0.36 ![X0,X1]: (defined(add(X0,X1))|~defined(X0)|~defined(X1))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f45])).
% 0.10/0.36 fof(f47,plain,(
% 0.10/0.36 defined(additive_identity)),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.36 fof(f48,plain,(
% 0.10/0.36 ![X0]: (defined(additive_inverse(X0))|~defined(X0))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f12])).
% 0.10/0.36 fof(f51,plain,(
% 0.10/0.36 defined(multiplicative_identity)),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f14])).
% 0.10/0.36 fof(f64,plain,(
% 0.10/0.36 ![Z,Y]: ((![X]: (equalish(X,Z)|~equalish(X,Y)))|~equalish(Y,Z))),
% 0.10/0.36 inference(miniscoping,[status(esa)],[f23])).
% 0.10/0.36 fof(f65,plain,(
% 0.10/0.36 ![X0,X1,X2]: (equalish(X0,X1)|~equalish(X0,X2)|~equalish(X2,X1))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f64])).
% 0.10/0.36 fof(f66,plain,(
% 0.10/0.36 ![X,Y]: ((![Z]: (equalish(add(X,Z),add(Y,Z))|~defined(Z)))|~equalish(X,Y))),
% 0.10/0.36 inference(miniscoping,[status(esa)],[f24])).
% 0.10/0.36 fof(f67,plain,(
% 0.10/0.36 ![X0,X1,X2]: (equalish(add(X0,X1),add(X2,X1))|~defined(X1)|~equalish(X0,X2))),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f66])).
% 0.10/0.36 fof(f73,plain,(
% 0.10/0.36 defined(a)),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f28])).
% 0.10/0.36 fof(f74,plain,(
% 0.10/0.36 defined(b)),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f29])).
% 0.10/0.36 fof(f75,plain,(
% 0.10/0.36 ~equalish(add(a,add(b,additive_inverse(b))),a)),
% 0.10/0.36 inference(cnf_transformation,[status(esa)],[f30])).
% 0.10/0.36 fof(f77,plain,(
% 0.10/0.36 ![X0]: (~equalish(add(a,add(b,additive_inverse(b))),X0)|~equalish(X0,a))),
% 0.10/0.36 inference(resolution,[status(thm)],[f65,f75])).
% 0.10/0.36 fof(f80,plain,(
% 0.10/0.36 ![X0,X1]: (~equalish(add(a,add(b,additive_inverse(b))),X0)|~equalish(X0,X1)|~equalish(X1,a))),
% 0.10/0.36 inference(resolution,[status(thm)],[f77,f65])).
% 0.10/0.36 fof(f85,plain,(
% 0.10/0.36 spl0_1 <=> defined(a)),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f87,plain,(
% 0.10/0.36 ~defined(a)|spl0_1),
% 0.10/0.36 inference(component_clause,[status(thm)],[f85])).
% 0.10/0.36 fof(f108,plain,(
% 0.10/0.36 $false|spl0_1),
% 0.10/0.36 inference(forward_subsumption_resolution,[status(thm)],[f87,f73])).
% 0.10/0.36 fof(f109,plain,(
% 0.10/0.36 spl0_1),
% 0.10/0.36 inference(contradiction_clause,[status(thm)],[f108])).
% 0.10/0.36 fof(f126,plain,(
% 0.10/0.36 spl0_6 <=> defined(additive_identity)),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f128,plain,(
% 0.10/0.36 ~defined(additive_identity)|spl0_6),
% 0.10/0.36 inference(component_clause,[status(thm)],[f126])).
% 0.10/0.36 fof(f136,plain,(
% 0.10/0.36 spl0_8 <=> defined(multiplicative_identity)),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f138,plain,(
% 0.10/0.36 ~defined(multiplicative_identity)|spl0_8),
% 0.10/0.36 inference(component_clause,[status(thm)],[f136])).
% 0.10/0.36 fof(f150,plain,(
% 0.10/0.36 spl0_10 <=> ~equalish(add(a,add(b,additive_inverse(b))),X0)|~equalish(X0,add(additive_identity,a))),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f151,plain,(
% 0.10/0.36 ![X0]: (~equalish(add(a,add(b,additive_inverse(b))),X0)|~equalish(X0,add(additive_identity,a))|~spl0_10)),
% 0.10/0.36 inference(component_clause,[status(thm)],[f150])).
% 0.10/0.36 fof(f153,plain,(
% 0.10/0.36 ![X0]: (~defined(a)|~equalish(add(a,add(b,additive_inverse(b))),X0)|~equalish(X0,add(additive_identity,a)))),
% 0.10/0.36 inference(resolution,[status(thm)],[f33,f80])).
% 0.10/0.36 fof(f154,plain,(
% 0.10/0.36 ~spl0_1|spl0_10),
% 0.10/0.36 inference(split_clause,[status(thm)],[f153,f85,f150])).
% 0.10/0.36 fof(f187,plain,(
% 0.10/0.36 spl0_16 <=> defined(b)),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f189,plain,(
% 0.10/0.36 ~defined(b)|spl0_16),
% 0.10/0.36 inference(component_clause,[status(thm)],[f187])).
% 0.10/0.36 fof(f190,plain,(
% 0.10/0.36 spl0_17 <=> defined(additive_inverse(b))),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f192,plain,(
% 0.10/0.36 ~defined(additive_inverse(b))|spl0_17),
% 0.10/0.36 inference(component_clause,[status(thm)],[f190])).
% 0.10/0.36 fof(f198,plain,(
% 0.10/0.36 spl0_19 <=> defined(add(b,additive_inverse(b)))),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f200,plain,(
% 0.10/0.36 ~defined(add(b,additive_inverse(b)))|spl0_19),
% 0.10/0.36 inference(component_clause,[status(thm)],[f198])).
% 0.10/0.36 fof(f203,plain,(
% 0.10/0.36 spl0_20 <=> equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a))),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f205,plain,(
% 0.10/0.36 ~equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a))|spl0_20),
% 0.10/0.36 inference(component_clause,[status(thm)],[f203])).
% 0.10/0.36 fof(f206,plain,(
% 0.10/0.36 ~equalish(add(add(b,additive_inverse(b)),a),add(additive_identity,a))|~defined(a)|~defined(add(b,additive_inverse(b)))|~spl0_10),
% 0.10/0.36 inference(resolution,[status(thm)],[f151,f36])).
% 0.10/0.36 fof(f207,plain,(
% 0.10/0.36 ~spl0_20|~spl0_1|~spl0_19|~spl0_10),
% 0.10/0.36 inference(split_clause,[status(thm)],[f206,f203,f85,f198,f150])).
% 0.10/0.36 fof(f238,plain,(
% 0.10/0.36 ~defined(b)|~defined(additive_inverse(b))|spl0_19),
% 0.10/0.36 inference(resolution,[status(thm)],[f200,f46])).
% 0.10/0.36 fof(f239,plain,(
% 0.10/0.36 ~spl0_16|~spl0_17|spl0_19),
% 0.10/0.36 inference(split_clause,[status(thm)],[f238,f187,f190,f198])).
% 0.10/0.36 fof(f240,plain,(
% 0.10/0.36 $false|spl0_16),
% 0.10/0.36 inference(forward_subsumption_resolution,[status(thm)],[f189,f74])).
% 0.10/0.36 fof(f241,plain,(
% 0.10/0.36 spl0_16),
% 0.10/0.36 inference(contradiction_clause,[status(thm)],[f240])).
% 0.10/0.36 fof(f242,plain,(
% 0.10/0.36 ~defined(b)|spl0_17),
% 0.10/0.36 inference(resolution,[status(thm)],[f192,f48])).
% 0.10/0.36 fof(f243,plain,(
% 0.10/0.36 ~spl0_16|spl0_17),
% 0.10/0.36 inference(split_clause,[status(thm)],[f242,f187,f190])).
% 0.10/0.36 fof(f267,plain,(
% 0.10/0.36 $false|spl0_8),
% 0.10/0.36 inference(forward_subsumption_resolution,[status(thm)],[f138,f51])).
% 0.10/0.36 fof(f268,plain,(
% 0.10/0.36 spl0_8),
% 0.10/0.36 inference(contradiction_clause,[status(thm)],[f267])).
% 0.10/0.36 fof(f343,plain,(
% 0.10/0.36 $false|spl0_6),
% 0.10/0.36 inference(forward_subsumption_resolution,[status(thm)],[f128,f47])).
% 0.10/0.36 fof(f344,plain,(
% 0.10/0.36 spl0_6),
% 0.10/0.36 inference(contradiction_clause,[status(thm)],[f343])).
% 0.10/0.36 fof(f732,plain,(
% 0.10/0.36 spl0_85 <=> equalish(add(b,additive_inverse(b)),additive_identity)),
% 0.10/0.36 introduced(split_symbol_definition)).
% 0.10/0.36 fof(f734,plain,(
% 0.10/0.36 ~equalish(add(b,additive_inverse(b)),additive_identity)|spl0_85),
% 0.10/0.36 inference(component_clause,[status(thm)],[f732])).
% 0.10/0.36 fof(f735,plain,(
% 0.10/0.36 ~defined(a)|~equalish(add(b,additive_inverse(b)),additive_identity)|spl0_20),
% 0.10/0.36 inference(resolution,[status(thm)],[f205,f67])).
% 0.10/0.36 fof(f736,plain,(
% 0.10/0.36 ~spl0_1|~spl0_85|spl0_20),
% 0.10/0.37 inference(split_clause,[status(thm)],[f735,f85,f732,f203])).
% 0.10/0.37 fof(f739,plain,(
% 0.10/0.37 ~defined(b)|spl0_85),
% 0.10/0.37 inference(resolution,[status(thm)],[f734,f34])).
% 0.10/0.37 fof(f740,plain,(
% 0.10/0.37 ~spl0_16|spl0_85),
% 0.10/0.37 inference(split_clause,[status(thm)],[f739,f187,f732])).
% 0.10/0.37 fof(f743,plain,(
% 0.10/0.37 $false),
% 0.10/0.37 inference(sat_refutation,[status(thm)],[f109,f154,f207,f239,f241,f243,f268,f344,f736,f740])).
% 0.10/0.37 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.37 % Elapsed time: 0.047715 seconds
% 0.10/0.37 % CPU time: 0.282199 seconds
% 0.10/0.37 % Total memory used: 13.595 MB
% 0.10/0.37 % Net memory used: 13.342 MB
%------------------------------------------------------------------------------