TSTP Solution File: LCL185-3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL185-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n031.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:32 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.00/0.06 % Problem : LCL185-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n031.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 30 10:06:52 EDT 2023
% 0.06/0.25 % CPUTime :
% 0.06/0.26 % 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 (![A]: (axiom(implies(or(A,A),A)) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f2,axiom,(
% 0.10/0.37 (![A,B]: (axiom(implies(A,or(B,A))) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f3,axiom,(
% 0.10/0.37 (![A,B]: (axiom(implies(or(A,B),or(B,A))) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f5,axiom,(
% 0.10/0.37 (![A,B,C]: (axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f6,axiom,(
% 0.10/0.37 (![X,Y]: (implies(X,Y) = or(not(X),Y) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f7,axiom,(
% 0.10/0.37 (![X]: (( theorem(X)| ~ axiom(X) ) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f8,axiom,(
% 0.10/0.37 (![X,Y]: (( theorem(X)| ~ theorem(implies(Y,X))| ~ theorem(Y) ) ))),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f9,negated_conjecture,(
% 0.10/0.37 ~ theorem(implies(p,or(p,q))) ),
% 0.10/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.37 fof(f10,plain,(
% 0.10/0.37 ![X0]: (axiom(implies(or(X0,X0),X0)))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f1])).
% 0.10/0.37 fof(f11,plain,(
% 0.10/0.37 ![X0,X1]: (axiom(implies(X0,or(X1,X0))))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f2])).
% 0.10/0.37 fof(f12,plain,(
% 0.10/0.37 ![X0,X1]: (axiom(implies(or(X0,X1),or(X1,X0))))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f3])).
% 0.10/0.37 fof(f14,plain,(
% 0.10/0.37 ![X0,X1,X2]: (axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f5])).
% 0.10/0.37 fof(f15,plain,(
% 0.10/0.37 ![X0,X1]: (implies(X0,X1)=or(not(X0),X1))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f6])).
% 0.10/0.37 fof(f16,plain,(
% 0.10/0.37 ![X0]: (theorem(X0)|~axiom(X0))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f7])).
% 0.10/0.37 fof(f17,plain,(
% 0.10/0.37 ![Y]: ((![X]: (theorem(X)|~theorem(implies(Y,X))))|~theorem(Y))),
% 0.10/0.37 inference(miniscoping,[status(esa)],[f8])).
% 0.10/0.37 fof(f18,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(X0)|~theorem(implies(X1,X0))|~theorem(X1))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f17])).
% 0.10/0.37 fof(f19,plain,(
% 0.10/0.37 ~theorem(implies(p,or(p,q)))),
% 0.10/0.37 inference(cnf_transformation,[status(esa)],[f9])).
% 0.10/0.37 fof(f20,plain,(
% 0.10/0.37 ![X0]: (theorem(implies(or(X0,X0),X0)))),
% 0.10/0.37 inference(resolution,[status(thm)],[f10,f16])).
% 0.10/0.37 fof(f22,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(implies(X0,or(X1,X0))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f11,f16])).
% 0.10/0.37 fof(f23,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(or(X0,X1))|~theorem(X1))),
% 0.10/0.37 inference(resolution,[status(thm)],[f22,f18])).
% 0.10/0.37 fof(f34,plain,(
% 0.10/0.37 spl0_1 <=> ~theorem(X1)),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f35,plain,(
% 0.10/0.37 ![X0]: (~theorem(X0)|~spl0_1)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f34])).
% 0.10/0.37 fof(f42,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(implies(or(X0,X1),or(X1,X0))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f12,f16])).
% 0.10/0.37 fof(f45,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(or(X0,X1))|~theorem(or(X1,X0)))),
% 0.10/0.37 inference(resolution,[status(thm)],[f42,f18])).
% 0.10/0.37 fof(f49,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(or(X0,X1))|~theorem(X0))),
% 0.10/0.37 inference(resolution,[status(thm)],[f45,f23])).
% 0.10/0.37 fof(f78,plain,(
% 0.10/0.37 ![X0,X1,X2]: (axiom(implies(implies(X0,X1),implies(implies(X2,X0),or(not(X2),X1)))))),
% 0.10/0.37 inference(paramodulation,[status(thm)],[f15,f14])).
% 0.10/0.37 fof(f79,plain,(
% 0.10/0.37 ![X0,X1,X2]: (axiom(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))))),
% 0.10/0.37 inference(forward_demodulation,[status(thm)],[f15,f78])).
% 0.10/0.37 fof(f127,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(or(X0,X1))|~axiom(X1))),
% 0.10/0.37 inference(resolution,[status(thm)],[f23,f16])).
% 0.10/0.37 fof(f129,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(or(implies(or(X0,X0),X0),X1)))),
% 0.10/0.37 inference(resolution,[status(thm)],[f20,f49])).
% 0.10/0.37 fof(f133,plain,(
% 0.10/0.37 ![X0,X1,X2]: (theorem(or(X0,implies(X1,or(X2,X1)))))),
% 0.10/0.37 inference(resolution,[status(thm)],[f22,f23])).
% 0.10/0.37 fof(f152,plain,(
% 0.10/0.37 ![X0,X1]: (theorem(implies(X0,X1))|~axiom(X1))),
% 0.10/0.37 inference(paramodulation,[status(thm)],[f15,f127])).
% 0.10/0.37 fof(f179,plain,(
% 0.10/0.37 spl0_4 <=> ~axiom(X0)|theorem(X0)),
% 0.10/0.37 introduced(split_symbol_definition)).
% 0.10/0.37 fof(f180,plain,(
% 0.10/0.37 ![X0]: (~axiom(X0)|theorem(X0)|~spl0_4)),
% 0.10/0.37 inference(component_clause,[status(thm)],[f179])).
% 0.10/0.39 fof(f182,plain,(
% 0.10/0.39 ![X0,X1]: (~axiom(X0)|theorem(X0)|~theorem(X1))),
% 0.10/0.39 inference(resolution,[status(thm)],[f152,f18])).
% 0.10/0.39 fof(f183,plain,(
% 0.10/0.39 spl0_4|spl0_1),
% 0.10/0.39 inference(split_clause,[status(thm)],[f182,f179,f34])).
% 0.10/0.39 fof(f220,plain,(
% 0.10/0.39 ![X0,X1,X2]: (theorem(implies(X0,implies(X1,or(X2,X1)))))),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f15,f133])).
% 0.10/0.39 fof(f302,plain,(
% 0.10/0.39 spl0_7 <=> theorem(implies(X0,or(X1,X0)))),
% 0.10/0.39 introduced(split_symbol_definition)).
% 0.10/0.39 fof(f303,plain,(
% 0.10/0.39 ![X0,X1]: (theorem(implies(X0,or(X1,X0)))|~spl0_7)),
% 0.10/0.39 inference(component_clause,[status(thm)],[f302])).
% 0.10/0.39 fof(f305,plain,(
% 0.10/0.39 ![X0,X1,X2]: (theorem(implies(X0,or(X1,X0)))|~theorem(X2))),
% 0.10/0.39 inference(resolution,[status(thm)],[f220,f18])).
% 0.10/0.39 fof(f306,plain,(
% 0.10/0.39 spl0_7|spl0_1),
% 0.10/0.39 inference(split_clause,[status(thm)],[f305,f302,f34])).
% 0.10/0.39 fof(f341,plain,(
% 0.10/0.39 $false|~spl0_1),
% 0.10/0.39 inference(backward_subsumption_resolution,[status(thm)],[f129,f35])).
% 0.10/0.39 fof(f342,plain,(
% 0.10/0.39 ~spl0_1),
% 0.10/0.39 inference(contradiction_clause,[status(thm)],[f341])).
% 0.10/0.39 fof(f377,plain,(
% 0.10/0.39 ![X0,X1]: (theorem(X0)|~theorem(X1)|~axiom(implies(X1,X0))|~spl0_4)),
% 0.10/0.39 inference(resolution,[status(thm)],[f18,f180])).
% 0.10/0.39 fof(f380,plain,(
% 0.10/0.39 ![X0,X1,X2]: (~theorem(X0)|~axiom(implies(X0,implies(X1,X2)))|theorem(X2)|~theorem(X1)|~spl0_4)),
% 0.10/0.39 inference(resolution,[status(thm)],[f377,f18])).
% 0.10/0.39 fof(f517,plain,(
% 0.10/0.39 ![X0,X1,X2]: (~theorem(implies(X0,X1))|theorem(implies(X2,X1))|~theorem(implies(X2,X0))|~spl0_4)),
% 0.10/0.39 inference(resolution,[status(thm)],[f380,f79])).
% 0.10/0.39 fof(f767,plain,(
% 0.10/0.39 ![X0]: (~theorem(implies(X0,or(p,q)))|~theorem(implies(p,X0))|~spl0_4)),
% 0.10/0.39 inference(resolution,[status(thm)],[f517,f19])).
% 0.10/0.39 fof(f3029,plain,(
% 0.10/0.39 ~theorem(implies(p,or(q,p)))|~spl0_4),
% 0.10/0.39 inference(resolution,[status(thm)],[f767,f42])).
% 0.10/0.39 fof(f3030,plain,(
% 0.10/0.39 $false|~spl0_7|~spl0_4),
% 0.10/0.39 inference(forward_subsumption_resolution,[status(thm)],[f3029,f303])).
% 0.10/0.39 fof(f3031,plain,(
% 0.10/0.39 ~spl0_7|~spl0_4),
% 0.10/0.39 inference(contradiction_clause,[status(thm)],[f3030])).
% 0.10/0.39 fof(f3032,plain,(
% 0.10/0.39 $false),
% 0.10/0.39 inference(sat_refutation,[status(thm)],[f183,f306,f342,f3031])).
% 0.10/0.39 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.39 % Elapsed time: 0.137005 seconds
% 0.10/0.39 % CPU time: 0.415894 seconds
% 0.10/0.39 % Memory used: 31.044 MB
%------------------------------------------------------------------------------