TSTP Solution File: COM003-2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n032.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:03:52 EDT 2023
% Result : Unsatisfiable 0.10s 0.31s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : COM003-2 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 30 11:49:46 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % Drodi V3.5.1
% 0.10/0.31 % Refutation found
% 0.10/0.31 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.31 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.31 fof(f11,axiom,(
% 0.10/0.31 (![X,Y]: (( ~ program_halts2(X,Y)| halts2(X,Y) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f17,axiom,(
% 0.10/0.31 (![X,Y]: (( ~ program_not_halts2(X,Y)| ~ halts2(X,Y) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f22,axiom,(
% 0.10/0.31 (![X,Y,Z,W]: (( ~ program_halts2_halts3_outputs(X,Y,Z,W)| program_halts2(Y,Z) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f25,axiom,(
% 0.10/0.31 (![X,Y,Z,W]: (( ~ program_not_halts2_halts3_outputs(X,Y,Z,W)| program_not_halts2(Y,Z) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f34,hypothesis,(
% 0.10/0.31 (![X]: (( ~ algorithm_program_decides(X)| program_program_decides(c1) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f35,hypothesis,(
% 0.10/0.31 (![W,Y,Z]: (( ~ program_program_decides(W)| program_halts2_halts3_outputs(W,Y,Z,good) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f36,hypothesis,(
% 0.10/0.31 (![W,Y,Z]: (( ~ program_program_decides(W)| program_not_halts2_halts3_outputs(W,Y,Z,bad) ) ))),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f43,negated_conjecture,(
% 0.10/0.31 algorithm_program_decides(c4) ),
% 0.10/0.31 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.10/0.31 fof(f56,plain,(
% 0.10/0.31 ![X0,X1]: (~program_halts2(X0,X1)|halts2(X0,X1))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f11])).
% 0.10/0.31 fof(f66,plain,(
% 0.10/0.31 ![X0,X1]: (~program_not_halts2(X0,X1)|~halts2(X0,X1))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f17])).
% 0.10/0.31 fof(f74,plain,(
% 0.10/0.31 ![Y,Z]: ((![X,W]: ~program_halts2_halts3_outputs(X,Y,Z,W))|program_halts2(Y,Z))),
% 0.10/0.31 inference(miniscoping,[status(esa)],[f22])).
% 0.10/0.31 fof(f75,plain,(
% 0.10/0.31 ![X0,X1,X2,X3]: (~program_halts2_halts3_outputs(X0,X1,X2,X3)|program_halts2(X1,X2))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f74])).
% 0.10/0.31 fof(f78,plain,(
% 0.10/0.31 ![Y,Z]: ((![X,W]: ~program_not_halts2_halts3_outputs(X,Y,Z,W))|program_not_halts2(Y,Z))),
% 0.10/0.31 inference(miniscoping,[status(esa)],[f25])).
% 0.10/0.31 fof(f79,plain,(
% 0.10/0.31 ![X0,X1,X2,X3]: (~program_not_halts2_halts3_outputs(X0,X1,X2,X3)|program_not_halts2(X1,X2))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f78])).
% 0.10/0.31 fof(f90,plain,(
% 0.10/0.31 (![X]: ~algorithm_program_decides(X))|program_program_decides(c1)),
% 0.10/0.31 inference(miniscoping,[status(esa)],[f34])).
% 0.10/0.31 fof(f91,plain,(
% 0.10/0.31 ![X0]: (~algorithm_program_decides(X0)|program_program_decides(c1))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f90])).
% 0.10/0.31 fof(f92,plain,(
% 0.10/0.31 ![W]: (~program_program_decides(W)|(![Y,Z]: program_halts2_halts3_outputs(W,Y,Z,good)))),
% 0.10/0.31 inference(miniscoping,[status(esa)],[f35])).
% 0.10/0.31 fof(f93,plain,(
% 0.10/0.31 ![X0,X1,X2]: (~program_program_decides(X0)|program_halts2_halts3_outputs(X0,X1,X2,good))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f92])).
% 0.10/0.31 fof(f94,plain,(
% 0.10/0.31 ![W]: (~program_program_decides(W)|(![Y,Z]: program_not_halts2_halts3_outputs(W,Y,Z,bad)))),
% 0.10/0.31 inference(miniscoping,[status(esa)],[f36])).
% 0.10/0.31 fof(f95,plain,(
% 0.10/0.31 ![X0,X1,X2]: (~program_program_decides(X0)|program_not_halts2_halts3_outputs(X0,X1,X2,bad))),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f94])).
% 0.10/0.31 fof(f108,plain,(
% 0.10/0.31 algorithm_program_decides(c4)),
% 0.10/0.31 inference(cnf_transformation,[status(esa)],[f43])).
% 0.10/0.31 fof(f109,plain,(
% 0.10/0.31 spl0_0 <=> ~algorithm_program_decides(X0)),
% 0.10/0.31 introduced(split_symbol_definition)).
% 0.10/0.31 fof(f110,plain,(
% 0.10/0.31 ![X0]: (~algorithm_program_decides(X0)|~spl0_0)),
% 0.10/0.31 inference(component_clause,[status(thm)],[f109])).
% 0.10/0.31 fof(f112,plain,(
% 0.10/0.31 spl0_1 <=> program_program_decides(c1)),
% 0.10/0.31 introduced(split_symbol_definition)).
% 0.10/0.31 fof(f113,plain,(
% 0.10/0.31 program_program_decides(c1)|~spl0_1),
% 0.10/0.31 inference(component_clause,[status(thm)],[f112])).
% 0.10/0.31 fof(f115,plain,(
% 0.10/0.31 spl0_0|spl0_1),
% 0.10/0.31 inference(split_clause,[status(thm)],[f91,f109,f112])).
% 0.10/0.31 fof(f146,plain,(
% 0.10/0.31 $false|~spl0_0),
% 0.10/0.31 inference(backward_subsumption_resolution,[status(thm)],[f108,f110])).
% 0.10/0.31 fof(f147,plain,(
% 0.10/0.31 ~spl0_0),
% 0.10/0.31 inference(contradiction_clause,[status(thm)],[f146])).
% 0.10/0.31 fof(f148,plain,(
% 0.10/0.31 ![X0,X1]: (program_not_halts2_halts3_outputs(c1,X0,X1,bad)|~spl0_1)),
% 0.10/0.31 inference(resolution,[status(thm)],[f113,f95])).
% 0.10/0.31 fof(f149,plain,(
% 0.10/0.31 ![X0,X1]: (program_halts2_halts3_outputs(c1,X0,X1,good)|~spl0_1)),
% 0.10/0.31 inference(resolution,[status(thm)],[f113,f93])).
% 0.10/0.31 fof(f161,plain,(
% 0.10/0.31 ![X0,X1]: (program_not_halts2(X0,X1)|~spl0_1)),
% 0.10/0.31 inference(resolution,[status(thm)],[f148,f79])).
% 0.10/0.31 fof(f164,plain,(
% 0.10/0.31 ![X0,X1]: (~halts2(X0,X1)|~spl0_1)),
% 0.10/0.31 inference(backward_subsumption_resolution,[status(thm)],[f66,f161])).
% 0.10/0.31 fof(f167,plain,(
% 0.10/0.31 ![X0,X1]: (~program_halts2(X0,X1)|~spl0_1)),
% 0.10/0.31 inference(backward_subsumption_resolution,[status(thm)],[f56,f164])).
% 0.10/0.31 fof(f174,plain,(
% 0.10/0.31 ![X0,X1,X2,X3]: (~program_halts2_halts3_outputs(X0,X1,X2,X3)|~spl0_1)),
% 0.10/0.31 inference(backward_subsumption_resolution,[status(thm)],[f75,f167])).
% 0.10/0.31 fof(f177,plain,(
% 0.10/0.31 $false|~spl0_1),
% 0.10/0.31 inference(backward_subsumption_resolution,[status(thm)],[f149,f174])).
% 0.10/0.31 fof(f178,plain,(
% 0.10/0.31 ~spl0_1),
% 0.10/0.31 inference(contradiction_clause,[status(thm)],[f177])).
% 0.10/0.31 fof(f179,plain,(
% 0.10/0.31 $false),
% 0.10/0.31 inference(sat_refutation,[status(thm)],[f115,f147,f178])).
% 0.10/0.31 % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.53 % Elapsed time: 0.009155 seconds
% 0.14/0.53 % CPU time: 0.027268 seconds
% 0.14/0.53 % Memory used: 2.216 MB
%------------------------------------------------------------------------------