TSTP Solution File: LCL065-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.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:18:09 EDT 2023
% Result : Unsatisfiable 0.10s 0.37s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n023.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 10:02:23 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.32 % Drodi V3.5.1
% 0.10/0.37 % Refutation found
% 0.10/0.37 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.37 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.37 fof(f1,axiom,(
% 0.10/0.37 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f2,axiom,(
% 0.10/0.37 (![X,Y]: (is_a_theorem(implies(X,implies(Y,X))) ))),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f3,axiom,(
% 0.10/0.37 (![X,Y,Z]: (is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) ))),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f4,axiom,(
% 0.10/0.37 (![X,Y]: (is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ))),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f5,negated_conjecture,(
% 0.10/0.37 ~ is_a_theorem(implies(implies(not(a),a),a)) ),
% 0.10/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f6,plain,(
% 0.10/0.37 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 0.10/0.37 inference(miniscoping,[status(esa)],[f1])).
% 0.10/0.37 fof(f7,plain,(
% 0.10/0.37 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f6])).
% 0.10/0.37 fof(f8,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0))))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f2])).
% 0.10/0.37 fof(f9,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f3])).
% 0.10/0.37 fof(f10,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f4])).
% 0.10/0.37 fof(f11,plain,(
% 0.10/0.37 ~is_a_theorem(implies(implies(not(a),a),a))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f5])).
% 0.10/0.37 fof(f12,plain,(
% 0.10/0.37 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,X0)))),
% 0.10/0.37 inference(resolution,[status(thm)],[f7,f8])).
% 0.10/0.37 fof(f13,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f12,f8])).
% 0.10/0.37 fof(f14,plain,(
% 0.10/0.37 spl0_0 <=> ~is_a_theorem(X0)),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f15,plain,(
% 0.10/0.37 ![X0]: (~is_a_theorem(X0)|~spl0_0)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f14])).
% 0.10/0.37 fof(f17,plain,(
% 0.10/0.37 spl0_1 <=> is_a_theorem(implies(X1,implies(X2,X1)))),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f18,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0)))|~spl0_1)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f17])).
% 0.10/0.37 fof(f20,plain,(
% 0.10/0.37 ![X0,X1,X2]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,implies(X2,X1))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f13,f7])).
% 0.10/0.37 fof(f21,plain,(
% 0.10/0.37 spl0_0|spl0_1),
% 0.10/0.37 inference(split_clause,[status(thm)],[f20,f14,f17])).
% 0.10/0.37 fof(f23,plain,(
% 0.10/0.37 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,X2)))|is_a_theorem(implies(implies(X0,X1),implies(X0,X2))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f9,f7])).
% 0.10/0.37 fof(f32,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(implies(not(X1),not(X2)),implies(X2,X1)))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f10,f12])).
% 0.10/0.37 fof(f44,plain,(
% 0.10/0.37 ![X0,X1,X2,X3]: (is_a_theorem(implies(X0,implies(X1,implies(implies(not(X2),not(X3)),implies(X3,X2))))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f32,f12])).
% 0.10/0.37 fof(f45,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(implies(implies(not(X0),not(X1)),X1),implies(implies(not(X0),not(X1)),X0))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f23,f10])).
% 0.10/0.37 fof(f46,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X0,X1)),implies(implies(X0,implies(X1,X2)),implies(X0,X2)))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f23,f9])).
% 0.10/0.37 fof(f51,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(X0,X0))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f23,f8])).
% 0.10/0.37 fof(f53,plain,(
% 0.10/0.37 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(X0,X0)))),
% 0.10/0.37 inference(resolution,[status(thm)],[f51,f7])).
% 0.10/0.37 fof(f58,plain,(
% 0.10/0.37 ![X0]: (is_a_theorem(implies(X0,X0)))),
% 0.10/0.37 inference(resolution,[status(thm)],[f53,f32])).
% 0.10/0.37 fof(f65,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X1))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f58,f12])).
% 0.10/0.37 fof(f82,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(X1,implies(X2,X2)))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f65,f12])).
% 0.10/0.37 fof(f84,plain,(
% 0.10/0.37 spl0_7 <=> is_a_theorem(implies(X1,implies(X2,X2)))),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f85,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X1)))|~spl0_7)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f84])).
% 0.10/0.37 fof(f87,plain,(
% 0.10/0.37 ![X0,X1,X2]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,implies(X2,X2))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f82,f7])).
% 0.10/0.37 fof(f88,plain,(
% 0.10/0.37 spl0_0|spl0_7),
% 0.10/0.37 inference(split_clause,[status(thm)],[f87,f14,f84])).
% 0.10/0.37 fof(f166,plain,(
% 0.10/0.37 ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X1)))|is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f46,f7])).
% 0.10/0.37 fof(f172,plain,(
% 0.10/0.37 spl0_10 <=> is_a_theorem(implies(X1,implies(implies(not(X2),not(X3)),implies(X3,X2))))),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f173,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(X0,implies(implies(not(X1),not(X2)),implies(X2,X1))))|~spl0_10)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f172])).
% 0.10/0.37 fof(f175,plain,(
% 0.10/0.37 ![X0,X1,X2,X3]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,implies(implies(not(X2),not(X3)),implies(X3,X2)))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f44,f7])).
% 0.10/0.37 fof(f176,plain,(
% 0.10/0.37 spl0_0|spl0_10),
% 0.10/0.37 inference(split_clause,[status(thm)],[f175,f14,f172])).
% 0.10/0.37 fof(f186,plain,(
% 0.10/0.37 $false|~spl0_0),
% 0.10/0.37 inference(backward_subsumption_resolution,[status(thm)],[f45,f15])).
% 0.10/0.37 fof(f187,plain,(
% 0.10/0.37 ~spl0_0),
% 0.10/0.37 inference(contradiction_clause,[status(thm)],[f186])).
% 0.10/0.37 fof(f420,plain,(
% 0.10/0.37 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,implies(not(X1),not(X2))),implies(X0,implies(X2,X1))))|~spl0_10)),
% 0.10/0.37 inference(resolution,[status(thm)],[f23,f173])).
% 0.10/0.37 fof(f510,plain,(
% 0.10/0.37 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(not(X1),not(X2))))|is_a_theorem(implies(X0,implies(X2,X1)))|~spl0_10)),
% 0.10/0.37 inference(resolution,[status(thm)],[f420,f7])).
% 0.10/0.37 fof(f532,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(not(X0),implies(X0,X1)))|~spl0_10|~spl0_1)),
% 0.10/0.37 inference(resolution,[status(thm)],[f510,f18])).
% 0.10/0.37 fof(f534,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(implies(not(X0),X0),implies(not(X0),X1)))|~spl0_10|~spl0_1)),
% 0.10/0.37 inference(resolution,[status(thm)],[f532,f23])).
% 0.10/0.37 fof(f570,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0)))|~spl0_1|~spl0_10)),
% 0.10/0.37 inference(resolution,[status(thm)],[f534,f510])).
% 0.10/0.37 fof(f673,plain,(
% 0.10/0.37 spl0_34 <=> is_a_theorem(X1)),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f674,plain,(
% 0.10/0.37 ![X0]: (is_a_theorem(X0)|~spl0_34)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f673])).
% 0.10/0.37 fof(f696,plain,(
% 0.10/0.37 $false|~spl0_34),
% 0.10/0.37 inference(backward_subsumption_resolution,[status(thm)],[f11,f674])).
% 0.10/0.37 fof(f697,plain,(
% 0.10/0.37 ~spl0_34),
% 0.10/0.37 inference(contradiction_clause,[status(thm)],[f696])).
% 0.10/0.37 fof(f1311,plain,(
% 0.10/0.37 ![X0,X1]: (is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))|~spl0_7)),
% 0.10/0.37 inference(resolution,[status(thm)],[f166,f85])).
% 0.10/0.37 fof(f1580,plain,(
% 0.10/0.37 ![X0,X1]: (~is_a_theorem(implies(X0,implies(X0,X1)))|is_a_theorem(implies(X0,X1))|~spl0_7)),
% 0.10/0.37 inference(resolution,[status(thm)],[f1311,f7])).
% 0.10/0.37 fof(f1711,plain,(
% 0.10/0.37 ![X0]: (is_a_theorem(implies(implies(not(X0),X0),X0))|~spl0_7|~spl0_1|~spl0_10)),
% 0.10/0.37 inference(resolution,[status(thm)],[f1580,f570])).
% 0.10/0.37 fof(f1844,plain,(
% 0.10/0.37 $false|~spl0_7|~spl0_1|~spl0_10),
% 0.10/0.37 inference(backward_subsumption_resolution,[status(thm)],[f11,f1711])).
% 0.10/0.37 fof(f1845,plain,(
% 0.10/0.37 ~spl0_7|~spl0_1|~spl0_10),
% 0.10/0.37 inference(contradiction_clause,[status(thm)],[f1844])).
% 0.10/0.37 fof(f1846,plain,(
% 0.10/0.37 $false),
% 0.10/0.37 inference(sat_refutation,[status(thm)],[f21,f88,f176,f187,f697,f1845])).
% 0.10/0.37 % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.39 % Elapsed time: 0.066191 seconds
% 0.15/0.39 % CPU time: 0.182985 seconds
% 0.15/0.39 % Memory used: 18.419 MB
%------------------------------------------------------------------------------