TSTP Solution File: LCL071-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL071-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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:18:10 EDT 2023
% Result : Unsatisfiable 5.05s 1.10s
% Output : CNFRefutation 5.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL071-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 09:32:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 5.05/1.10 % Refutation found
% 5.05/1.10 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 5.05/1.10 % SZS output start CNFRefutation for theBenchmark
% 5.05/1.10 fof(f1,axiom,(
% 5.05/1.10 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 5.05/1.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.05/1.10 fof(f2,axiom,(
% 5.05/1.10 (![X,Y,Z]: (is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))) ))),
% 5.05/1.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.05/1.10 fof(f3,axiom,(
% 5.05/1.10 (![X,Y,Z]: (is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))) ))),
% 5.05/1.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.05/1.10 fof(f4,axiom,(
% 5.05/1.10 (![X,Y,Z,U]: (is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(U,Z),implies(implies(Y,U),Z))))) ))),
% 5.05/1.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.05/1.10 fof(f5,negated_conjecture,(
% 5.05/1.10 ~ is_a_theorem(implies(implies(not(a),a),a)) ),
% 5.05/1.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.05/1.10 fof(f6,plain,(
% 5.05/1.10 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 5.05/1.10 inference(miniscoping,[status(esa)],[f1])).
% 5.05/1.10 fof(f7,plain,(
% 5.05/1.10 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 5.05/1.10 inference(cnf_transformation,[status(esa)],[f6])).
% 5.05/1.10 fof(f8,plain,(
% 5.05/1.10 ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))))),
% 5.05/1.10 inference(cnf_transformation,[status(esa)],[f2])).
% 5.05/1.10 fof(f9,plain,(
% 5.05/1.10 ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))))),
% 5.05/1.10 inference(cnf_transformation,[status(esa)],[f3])).
% 5.05/1.10 fof(f10,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(X0,implies(not(X1),X2)),implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))))),
% 5.05/1.10 inference(cnf_transformation,[status(esa)],[f4])).
% 5.05/1.10 fof(f11,plain,(
% 5.05/1.10 ~is_a_theorem(implies(implies(not(a),a),a))),
% 5.05/1.10 inference(cnf_transformation,[status(esa)],[f5])).
% 5.05/1.10 fof(f12,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X2))|is_a_theorem(implies(X1,X2)))),
% 5.05/1.10 inference(resolution,[status(thm)],[f8,f7])).
% 5.05/1.10 fof(f13,plain,(
% 5.05/1.10 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f12,f8])).
% 5.05/1.10 fof(f14,plain,(
% 5.05/1.10 ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f13,f12])).
% 5.05/1.10 fof(f17,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X2))|is_a_theorem(implies(not(X0),X2)))),
% 5.05/1.10 inference(resolution,[status(thm)],[f9,f7])).
% 5.05/1.10 fof(f23,plain,(
% 5.05/1.10 spl0_1 <=> ~is_a_theorem(X1)),
% 5.05/1.10 introduced(split_symbol_definition)).
% 5.05/1.10 fof(f24,plain,(
% 5.05/1.10 ![X0]: (~is_a_theorem(X0)|~spl0_1)),
% 5.05/1.10 inference(component_clause,[status(thm)],[f23])).
% 5.05/1.10 fof(f44,plain,(
% 5.05/1.10 ![X0,X1,X2]: (is_a_theorem(implies(not(implies(X0,X1)),implies(not(X0),X2))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f17,f9])).
% 5.05/1.10 fof(f45,plain,(
% 5.05/1.10 ![X0,X1,X2]: (is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f17,f8])).
% 5.05/1.10 fof(f48,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (is_a_theorem(implies(not(X0),implies(X1,implies(X2,implies(X0,X3))))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f17,f14])).
% 5.05/1.10 fof(f55,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (is_a_theorem(implies(implies(not(X0),X1),implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f10,f12])).
% 5.05/1.10 fof(f56,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,implies(not(X1),X2)))|is_a_theorem(implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2)))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f10,f7])).
% 5.05/1.10 fof(f59,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,implies(not(X1),X2)))|~is_a_theorem(X0)|is_a_theorem(implies(implies(X3,X2),implies(implies(X1,X3),X2))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f56,f7])).
% 5.05/1.10 fof(f87,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(not(X0),X1))|is_a_theorem(implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1)))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f55,f7])).
% 5.05/1.10 fof(f92,plain,(
% 5.05/1.10 $false|~spl0_1),
% 5.05/1.10 inference(backward_subsumption_resolution,[status(thm)],[f44,f24])).
% 5.05/1.10 fof(f93,plain,(
% 5.05/1.10 ~spl0_1),
% 5.05/1.10 inference(contradiction_clause,[status(thm)],[f92])).
% 5.05/1.10 fof(f142,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,implies(not(X1),X2)))|~is_a_theorem(X0)|~is_a_theorem(implies(X3,X2))|is_a_theorem(implies(implies(X1,X3),X2)))),
% 5.05/1.10 inference(resolution,[status(thm)],[f59,f7])).
% 5.05/1.10 fof(f166,plain,(
% 5.05/1.10 spl0_7 <=> ~is_a_theorem(implies(not(X0),X1))|is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1)))),
% 5.05/1.10 introduced(split_symbol_definition)).
% 5.05/1.10 fof(f167,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(not(X0),X1))|is_a_theorem(implies(implies(X2,X1),implies(implies(X0,X2),X1)))|~spl0_7)),
% 5.05/1.10 inference(component_clause,[status(thm)],[f166])).
% 5.05/1.10 fof(f169,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(not(X0),X1))|~is_a_theorem(X2)|is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))))),
% 5.05/1.10 inference(resolution,[status(thm)],[f87,f7])).
% 5.05/1.10 fof(f170,plain,(
% 5.05/1.10 spl0_7|spl0_1),
% 5.05/1.10 inference(split_clause,[status(thm)],[f169,f166,f23])).
% 5.05/1.10 fof(f185,plain,(
% 5.05/1.10 spl0_9 <=> ~is_a_theorem(implies(X0,implies(not(not(a)),a)))|~is_a_theorem(X0)),
% 5.05/1.10 introduced(split_symbol_definition)).
% 5.05/1.10 fof(f186,plain,(
% 5.05/1.10 ![X0]: (~is_a_theorem(implies(X0,implies(not(not(a)),a)))|~is_a_theorem(X0)|~spl0_9)),
% 5.05/1.10 inference(component_clause,[status(thm)],[f185])).
% 5.05/1.10 fof(f188,plain,(
% 5.05/1.10 spl0_10 <=> is_a_theorem(implies(a,a))),
% 5.05/1.10 introduced(split_symbol_definition)).
% 5.05/1.10 fof(f190,plain,(
% 5.05/1.10 ~is_a_theorem(implies(a,a))|spl0_10),
% 5.05/1.10 inference(component_clause,[status(thm)],[f188])).
% 5.05/1.10 fof(f191,plain,(
% 5.05/1.10 ![X0]: (~is_a_theorem(implies(X0,implies(not(not(a)),a)))|~is_a_theorem(X0)|~is_a_theorem(implies(a,a)))),
% 5.05/1.10 inference(resolution,[status(thm)],[f142,f11])).
% 5.05/1.10 fof(f192,plain,(
% 5.05/1.10 spl0_9|~spl0_10),
% 5.05/1.10 inference(split_clause,[status(thm)],[f191,f185,f188])).
% 5.05/1.10 fof(f194,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,implies(not(X1),X2)))|~is_a_theorem(X0)|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3))|is_a_theorem(X2))),
% 5.05/1.10 inference(resolution,[status(thm)],[f142,f7])).
% 5.05/1.10 fof(f198,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(not(X0),X1))|~is_a_theorem(implies(X2,X1))|is_a_theorem(implies(implies(X0,X2),X1))|~spl0_7)),
% 5.05/1.10 inference(resolution,[status(thm)],[f167,f7])).
% 5.05/1.10 fof(f205,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(not(X0),X1))|~is_a_theorem(implies(X2,X1))|~is_a_theorem(implies(X0,X2))|is_a_theorem(X1)|~spl0_7)),
% 5.05/1.10 inference(resolution,[status(thm)],[f198,f7])).
% 5.05/1.10 fof(f209,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,implies(X1,X2)))|~is_a_theorem(implies(implies(X3,X1),X0))|is_a_theorem(implies(X1,X2))|~spl0_7)),
% 5.05/1.10 inference(resolution,[status(thm)],[f205,f45])).
% 5.05/1.10 fof(f233,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))|is_a_theorem(implies(X1,X2))|~spl0_7)),
% 5.05/1.10 inference(resolution,[status(thm)],[f209,f8])).
% 5.05/1.10 fof(f258,plain,(
% 5.05/1.10 ![X0]: (is_a_theorem(implies(X0,X0))|~spl0_7)),
% 5.05/1.10 inference(resolution,[status(thm)],[f233,f8])).
% 5.05/1.10 fof(f276,plain,(
% 5.05/1.10 $false|~spl0_7|spl0_10),
% 5.05/1.10 inference(backward_subsumption_resolution,[status(thm)],[f190,f258])).
% 5.05/1.10 fof(f277,plain,(
% 5.05/1.10 ~spl0_7|spl0_10),
% 5.05/1.10 inference(contradiction_clause,[status(thm)],[f276])).
% 5.05/1.10 fof(f281,plain,(
% 5.05/1.10 ![X0,X1]: (is_a_theorem(implies(not(X0),implies(X0,X1)))|~spl0_7)),
% 5.05/1.10 inference(resolution,[status(thm)],[f258,f17])).
% 5.05/1.10 fof(f288,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X2,implies(not(X0),implies(not(not(a)),a))))|~is_a_theorem(X2)|~is_a_theorem(implies(X1,implies(not(not(a)),a)))|~spl0_9)),
% 5.05/1.10 inference(resolution,[status(thm)],[f186,f142])).
% 5.05/1.10 fof(f478,plain,(
% 5.05/1.10 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(implies(not(a),X1),a)))|~is_a_theorem(implies(X2,implies(not(X0),implies(not(not(a)),a))))|~is_a_theorem(X2)|~spl0_9)),
% 5.05/1.10 inference(resolution,[status(thm)],[f288,f9])).
% 5.05/1.10 fof(f531,plain,(
% 5.05/1.10 ![X0]: (~is_a_theorem(implies(X0,implies(not(a),implies(not(not(a)),a))))|~is_a_theorem(X0)|~spl0_9)),
% 5.05/1.10 inference(resolution,[status(thm)],[f478,f13])).
% 5.05/1.10 fof(f547,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,X1),X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X0,X3))|is_a_theorem(X2))),
% 5.05/1.10 inference(resolution,[status(thm)],[f194,f9])).
% 5.05/1.10 fof(f548,plain,(
% 5.05/1.10 ![X0,X1,X2,X3]: (~is_a_theorem(implies(implies(X0,not(X1)),X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3))|is_a_theorem(X2))),
% 5.05/1.11 inference(resolution,[status(thm)],[f194,f8])).
% 5.05/1.11 fof(f618,plain,(
% 5.05/1.11 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,implies(X1,implies(X2,X3))))|~is_a_theorem(implies(X2,X0))|is_a_theorem(implies(X1,implies(X2,X3))))),
% 5.05/1.11 inference(resolution,[status(thm)],[f547,f13])).
% 5.05/1.11 fof(f627,plain,(
% 5.05/1.11 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,not(X2))))|~is_a_theorem(implies(X2,X0))|is_a_theorem(implies(X1,not(X2))))),
% 5.05/1.11 inference(resolution,[status(thm)],[f548,f8])).
% 5.05/1.11 fof(f655,plain,(
% 5.05/1.11 ![X0,X1]: (~is_a_theorem(implies(X0,not(X1)))|is_a_theorem(implies(X1,not(X0)))|~spl0_7)),
% 5.05/1.11 inference(resolution,[status(thm)],[f627,f281])).
% 5.05/1.11 fof(f1256,plain,(
% 5.05/1.11 spl0_62 <=> ~is_a_theorem(implies(X2,implies(not(not(a)),a)))),
% 5.05/1.11 introduced(split_symbol_definition)).
% 5.05/1.11 fof(f1257,plain,(
% 5.05/1.11 ![X0]: (~is_a_theorem(implies(X0,implies(not(not(a)),a)))|~spl0_62)),
% 5.05/1.11 inference(component_clause,[status(thm)],[f1256])).
% 5.05/1.11 fof(f3150,plain,(
% 5.05/1.11 $false|~spl0_62),
% 5.05/1.11 inference(resolution,[status(thm)],[f1257,f44])).
% 5.05/1.11 fof(f3151,plain,(
% 5.05/1.11 ~spl0_62),
% 5.05/1.11 inference(contradiction_clause,[status(thm)],[f3150])).
% 5.05/1.11 fof(f3572,plain,(
% 5.05/1.11 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,not(X1)))|is_a_theorem(implies(X2,implies(X0,implies(X1,X3)))))),
% 5.05/1.11 inference(resolution,[status(thm)],[f618,f48])).
% 5.05/1.11 fof(f4295,plain,(
% 5.05/1.11 spl0_166 <=> is_a_theorem(implies(not(a),not(not(not(a)))))),
% 5.05/1.11 introduced(split_symbol_definition)).
% 5.05/1.11 fof(f4297,plain,(
% 5.05/1.11 ~is_a_theorem(implies(not(a),not(not(not(a)))))|spl0_166),
% 5.05/1.11 inference(component_clause,[status(thm)],[f4295])).
% 5.05/1.11 fof(f4298,plain,(
% 5.05/1.11 ![X0]: (~is_a_theorem(implies(not(a),not(not(not(a)))))|~is_a_theorem(X0)|~spl0_9)),
% 5.05/1.11 inference(resolution,[status(thm)],[f3572,f531])).
% 5.05/1.11 fof(f4299,plain,(
% 5.05/1.11 ~spl0_166|spl0_1|~spl0_9),
% 5.05/1.11 inference(split_clause,[status(thm)],[f4298,f4295,f23,f185])).
% 5.05/1.11 fof(f7826,plain,(
% 5.05/1.11 ~is_a_theorem(implies(not(not(a)),not(not(a))))|spl0_166|~spl0_7),
% 5.05/1.11 inference(resolution,[status(thm)],[f4297,f655])).
% 5.05/1.11 fof(f7827,plain,(
% 5.05/1.11 $false|spl0_166|~spl0_7),
% 5.05/1.11 inference(forward_subsumption_resolution,[status(thm)],[f7826,f258])).
% 5.05/1.11 fof(f7828,plain,(
% 5.05/1.11 spl0_166|~spl0_7),
% 5.05/1.11 inference(contradiction_clause,[status(thm)],[f7827])).
% 5.05/1.11 fof(f7829,plain,(
% 5.05/1.11 $false),
% 5.05/1.11 inference(sat_refutation,[status(thm)],[f93,f170,f192,f277,f3151,f4299,f7828])).
% 5.05/1.11 % SZS output end CNFRefutation for theBenchmark.p
% 5.05/1.13 % Elapsed time: 0.783098 seconds
% 5.05/1.13 % CPU time: 5.327958 seconds
% 5.05/1.13 % Memory used: 73.290 MB
%------------------------------------------------------------------------------