TSTP Solution File: SYN951+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN951+1 : TPTP v7.5.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n022.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 : 600s
% DateTime : Mon Mar 28 18:31:53 EDT 2022
% Result : Theorem 0.65s 0.57s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN951+1 : TPTP v7.5.0. Released v3.1.0.
% 0.03/0.12 % Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % RAMPerCPU : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Mar 10 18:10:43 EST 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.46 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.20/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox2/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.20/0.47 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.20/0.51 # hasConjecture: true isFOF: true
% 0.20/0.51 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.51 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.65/0.57 # -----------------
% 0.65/0.57 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.57
% 0.65/0.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf0,negated_conjecture,p(skf2),inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf3,negated_conjecture,~p(X3)|~b|~q,inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 cnf(c2,plain,~b|~q,inference(resolution, status(thm), [cnf3, cnf0])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf0,negated_conjecture,p(skf2),inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf2,negated_conjecture,~p(X2)|~b|q,inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 cnf(c1,plain,~b|q,inference(resolution, status(thm), [cnf2, cnf0])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf0,negated_conjecture,p(skf2),inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf4,negated_conjecture,~p(X4)|b|q,inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 cnf(c3,plain,b|q,inference(resolution, status(thm), [cnf4, cnf0])).
% 0.65/0.57 cnf(c4,plain,q,inference(resolution, status(thm), [c3, c1])).
% 0.65/0.57 cnf(c6,plain,~b,inference(resolution, status(thm), [c4, c2])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf0,negated_conjecture,p(skf2),inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf2,negated_conjecture,~p(X2)|~b|q,inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 cnf(c1,plain,~b|q,inference(resolution, status(thm), [cnf2, cnf0])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf0,negated_conjecture,p(skf2),inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.57 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.57 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.57 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.57 cnf(cnf4,negated_conjecture,~p(X4)|b|q,inference(split_conjunct, status(thm), [f9])).
% 0.65/0.57 cnf(c3,plain,b|q,inference(resolution, status(thm), [cnf4, cnf0])).
% 0.65/0.57 cnf(c4,plain,q,inference(resolution, status(thm), [c3, c1])).
% 0.65/0.57 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.57 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.57 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.57 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.57 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.58 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.58 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.58 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.58 cnf(cnf0,negated_conjecture,p(skf2),inference(split_conjunct, status(thm), [f9])).
% 0.65/0.58 fof(prove_this,conjecture,((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q))))),input).
% 0.65/0.58 fof(f1,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|(~b))&(q=>q)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.65/0.58 fof(f4,negated_conjecture,(~((?[X]:p(X))=>((?[X]:p(X))&(a=>((b|~b)&(q=>q)))))),inference(fof_simplification, status(thm), [f1])).
% 0.65/0.58 fof(f5,negated_conjecture,((?[X]:p(X))&((![X]:~p(X))|(a&((~b&b)|(q&~q))))),inference(fof_nnf, status(thm), [f4])).
% 0.65/0.58 fof(f6,negated_conjecture,((?[VAR0]:p(VAR0))&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(variable_rename, status(thm), [f5])).
% 0.65/0.58 fof(f7,negated_conjecture,(p(skf2)&((![VAR1]:~p(VAR1))|(a&((~b&b)|(q&~q))))),inference(skolemize, status(esa), [f6])).
% 0.65/0.58 fof(f8,negated_conjecture,(p(skf2)&(~p(VAR1)|(a&((~b&b)|(q&~q))))),inference(shift_quantors, status(thm), [f7])).
% 0.65/0.58 fof(f9,negated_conjecture,(p(skf2)&((~p(VAR1)|a)&(((~p(VAR1)|(~b|q))&(~p(VAR1)|(~b|~q)))&((~p(VAR1)|(b|q))&(~p(VAR1)|(b|~q)))))),inference(distribute, status(thm), [f8])).
% 0.65/0.58 cnf(cnf5,negated_conjecture,~p(X5)|b|~q,inference(split_conjunct, status(thm), [f9])).
% 0.65/0.58 cnf(c8,plain,b|~q,inference(resolution, status(thm), [cnf5, cnf0])).
% 0.65/0.58 cnf(c9,plain,b,inference(resolution, status(thm), [c8, c4])).
% 0.65/0.58 cnf(c12,plain,$false,inference(resolution, status(thm), [c9, c6])).
% 0.65/0.58 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.58 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.58 # Indexed : true
% 0.65/0.58 # Eval function name : PickGiven5
% 0.65/0.58 # Initial clauses : 6
% 0.65/0.58 # Processed clauses : 14
% 0.65/0.58 # Factors computed : 0
% 0.65/0.58 # Resolvents computed: 13
% 0.65/0.58 # Tautologies deleted: 1
% 0.65/0.58 # Forward subsumed : 1
% 0.65/0.58 # Backward subsumed : 17
% 0.65/0.58 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.58 # SZS Expected : Theorem
% 0.65/0.58 # time : 53ms
% 0.65/0.58
%------------------------------------------------------------------------------