%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN943+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 : n002.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:52 EDT 2022
% Result : Theorem 0.91s 0.65s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN943+1 : TPTP v7.5.0. Released v3.1.0.
% 0.11/0.13 % 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 : n002.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:09 EST 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.19/0.47 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/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.19/0.47 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.54 # hasConjecture: true isFOF: true
% 0.19/0.54 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.54 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.91/0.65 # -----------------
% 0.91/0.65 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.65
% 0.91/0.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf0,negated_conjecture,p(skf6),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf5,negated_conjecture,~p(X1)|~g(X1),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf6,negated_conjecture,~p(X2)|~c(X2),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf0,negated_conjecture,p(skf6),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf5,negated_conjecture,~p(X1)|~g(X1),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf1,negated_conjecture,e(skf6),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf3,negated_conjecture,~e(X5)|g(X5)|c(f(X5)),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 cnf(c1,plain,g(skf6)|c(f(skf6)),inference(resolution, status(thm), [cnf3, cnf1])).
% 0.91/0.65 cnf(c2,plain,c(f(skf6))|~p(skf6),inference(resolution, status(thm), [c1, cnf5])).
% 0.91/0.65 cnf(c4,plain,c(f(skf6)),inference(resolution, status(thm), [c2, cnf0])).
% 0.91/0.65 cnf(c5,plain,~p(f(skf6)),inference(resolution, status(thm), [c4, cnf6])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf4,negated_conjecture,~s(skf6,X3)|p(X3),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf1,negated_conjecture,e(skf6),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 fof(prove_this,conjecture,(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4)))))))))),input).
% 0.91/0.65 fof(f1,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.91/0.65 fof(f4,negated_conjecture,(~(![A]:(?[X]:(?[X2]:(?[X3]:(?[X4]:(?[Y]:(((((p(A)&e(A))&(e(X)=>(g(X)|s(X,f(X)))))&(e(X2)=>(g(X2)|c(f(X2)))))&(s(A,Y)=>p(Y)))=>((p(X3)&g(X3))|(p(X4)&c(X4))))))))))),inference(fof_simplification, status(thm), [f1])).
% 0.91/0.65 fof(f5,negated_conjecture,(?[A]:(![X]:(![X2]:(![X3]:(![X4]:(![Y]:(((((p(A)&e(A))&(~e(X)|(g(X)|s(X,f(X)))))&(~e(X2)|(g(X2)|c(f(X2)))))&(~s(A,Y)|p(Y)))&((~p(X3)|~g(X3))&(~p(X4)|~c(X4)))))))))),inference(fof_nnf, status(thm), [f4])).
% 0.91/0.65 fof(f6,negated_conjecture,(?[VAR5]:(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(VAR5)&e(VAR5))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(VAR5,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))))))))),inference(variable_rename, status(thm), [f5])).
% 0.91/0.65 fof(f7,negated_conjecture,(![VAR4]:(![VAR3]:(![VAR2]:(![VAR1]:(![VAR0]:(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1))))))))),inference(skolemize, status(esa), [f6])).
% 0.91/0.65 fof(f8,negated_conjecture,(((((p(skf6)&e(skf6))&(~e(VAR4)|(g(VAR4)|s(VAR4,f(VAR4)))))&(~e(VAR3)|(g(VAR3)|c(f(VAR3)))))&(~s(skf6,VAR0)|p(VAR0)))&((~p(VAR2)|~g(VAR2))&(~p(VAR1)|~c(VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.91/0.65 cnf(cnf2,negated_conjecture,~e(X4)|g(X4)|s(X4,f(X4)),inference(split_conjunct, status(thm), [f8])).
% 0.91/0.65 cnf(c0,plain,g(skf6)|s(skf6,f(skf6)),inference(resolution, status(thm), [cnf2, cnf1])).
% 0.91/0.65 cnf(c7,plain,g(skf6)|p(f(skf6)),inference(resolution, status(thm), [c0, cnf4])).
% 0.91/0.65 cnf(c9,plain,g(skf6),inference(resolution, status(thm), [c7, c5])).
% 0.91/0.65 cnf(c10,plain,~p(skf6),inference(resolution, status(thm), [c9, cnf5])).
% 0.91/0.65 cnf(c11,plain,$false,inference(resolution, status(thm), [c10, cnf0])).
% 0.91/0.65 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.66 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.66 # Indexed : true
% 0.91/0.66 # Eval function name : PickGiven5
% 0.91/0.66 # Initial clauses : 7
% 0.91/0.66 # Processed clauses : 15
% 0.91/0.66 # Factors computed : 0
% 0.91/0.66 # Resolvents computed: 12
% 0.91/0.66 # Tautologies deleted: 0
% 0.91/0.66 # Forward subsumed : 1
% 0.91/0.66 # Backward subsumed : 6
% 0.91/0.66 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/0.66 # SZS Expected : Theorem
% 0.91/0.66 # time : 104ms
% 0.91/0.66
%------------------------------------------------------------------------------