TSTP Solution File: SYN950+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN950+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 : n027.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.54s 0.54s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN950+1 : TPTP v7.5.0. Released v3.1.0.
% 0.07/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.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % RAMPerCPU : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Mar 10 18:19:56 EST 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 # 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.51 # hasConjecture: true isFOF: true
% 0.19/0.51 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.51 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.54/0.54 # -----------------
% 0.54/0.54 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.54
% 0.54/0.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.54 fof(prove_this,conjecture,(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B))))))),input).
% 0.54/0.54 fof(f1,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.54/0.54 fof(f4,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.54/0.54 fof(f5,negated_conjecture,(?[A]:(?[B]:((![Y]:(~q(Y)|p(Y)))&(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(fof_nnf, status(thm), [f4])).
% 0.54/0.54 fof(f6,negated_conjecture,((![Y]:(~q(Y)|p(Y)))&(?[A]:(?[B]:(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(shift_quantors, status(thm), [f5])).
% 0.54/0.54 fof(f7,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(?[VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1)&~p(VAR3))|(q(VAR1)&~p(VAR2))))))),inference(variable_rename, status(thm), [f6])).
% 0.54/0.54 fof(f8,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(![VAR1]:((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5))))),inference(skolemize, status(esa), [f7])).
% 0.54/0.54 fof(f9,negated_conjecture,((~q(VAR0)|p(VAR0))&((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5)))),inference(shift_quantors, status(thm), [f8])).
% 0.54/0.54 fof(f10,negated_conjecture,((~q(VAR0)|p(VAR0))&(((p(VAR1)|q(VAR1))&(p(VAR1)|~p(skf5)))&((~p(skf4)|q(VAR1))&(~p(skf4)|~p(skf5))))),inference(distribute, status(thm), [f9])).
% 0.54/0.54 cnf(cnf0,negated_conjecture,~q(X1)|p(X1),inference(split_conjunct, status(thm), [f10])).
% 0.54/0.54 fof(prove_this,conjecture,(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B))))))),input).
% 0.54/0.54 fof(f1,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.54/0.54 fof(f4,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.54/0.54 fof(f5,negated_conjecture,(?[A]:(?[B]:((![Y]:(~q(Y)|p(Y)))&(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(fof_nnf, status(thm), [f4])).
% 0.54/0.54 fof(f6,negated_conjecture,((![Y]:(~q(Y)|p(Y)))&(?[A]:(?[B]:(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(shift_quantors, status(thm), [f5])).
% 0.54/0.54 fof(f7,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(?[VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1)&~p(VAR3))|(q(VAR1)&~p(VAR2))))))),inference(variable_rename, status(thm), [f6])).
% 0.54/0.54 fof(f8,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(![VAR1]:((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5))))),inference(skolemize, status(esa), [f7])).
% 0.54/0.54 fof(f9,negated_conjecture,((~q(VAR0)|p(VAR0))&((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5)))),inference(shift_quantors, status(thm), [f8])).
% 0.54/0.54 fof(f10,negated_conjecture,((~q(VAR0)|p(VAR0))&(((p(VAR1)|q(VAR1))&(p(VAR1)|~p(skf5)))&((~p(skf4)|q(VAR1))&(~p(skf4)|~p(skf5))))),inference(distribute, status(thm), [f9])).
% 0.54/0.54 cnf(cnf1,negated_conjecture,p(X2)|q(X2),inference(split_conjunct, status(thm), [f10])).
% 0.54/0.54 cnf(c0,plain,p(X3),inference(resolution, status(thm), [cnf1, cnf0])).
% 0.54/0.54 fof(prove_this,conjecture,(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B))))))),input).
% 0.54/0.54 fof(f1,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.54/0.54 fof(f4,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.54/0.54 fof(f5,negated_conjecture,(?[A]:(?[B]:((![Y]:(~q(Y)|p(Y)))&(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(fof_nnf, status(thm), [f4])).
% 0.54/0.54 fof(f6,negated_conjecture,((![Y]:(~q(Y)|p(Y)))&(?[A]:(?[B]:(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(shift_quantors, status(thm), [f5])).
% 0.54/0.54 fof(f7,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(?[VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1)&~p(VAR3))|(q(VAR1)&~p(VAR2))))))),inference(variable_rename, status(thm), [f6])).
% 0.54/0.54 fof(f8,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(![VAR1]:((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5))))),inference(skolemize, status(esa), [f7])).
% 0.54/0.54 fof(f9,negated_conjecture,((~q(VAR0)|p(VAR0))&((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5)))),inference(shift_quantors, status(thm), [f8])).
% 0.54/0.54 fof(f10,negated_conjecture,((~q(VAR0)|p(VAR0))&(((p(VAR1)|q(VAR1))&(p(VAR1)|~p(skf5)))&((~p(skf4)|q(VAR1))&(~p(skf4)|~p(skf5))))),inference(distribute, status(thm), [f9])).
% 0.54/0.54 cnf(cnf0,negated_conjecture,~q(X1)|p(X1),inference(split_conjunct, status(thm), [f10])).
% 0.54/0.54 fof(prove_this,conjecture,(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B))))))),input).
% 0.54/0.54 fof(f1,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.54/0.54 fof(f4,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.54/0.54 fof(f5,negated_conjecture,(?[A]:(?[B]:((![Y]:(~q(Y)|p(Y)))&(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(fof_nnf, status(thm), [f4])).
% 0.54/0.54 fof(f6,negated_conjecture,((![Y]:(~q(Y)|p(Y)))&(?[A]:(?[B]:(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(shift_quantors, status(thm), [f5])).
% 0.54/0.54 fof(f7,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(?[VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1)&~p(VAR3))|(q(VAR1)&~p(VAR2))))))),inference(variable_rename, status(thm), [f6])).
% 0.54/0.54 fof(f8,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(![VAR1]:((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5))))),inference(skolemize, status(esa), [f7])).
% 0.54/0.54 fof(f9,negated_conjecture,((~q(VAR0)|p(VAR0))&((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5)))),inference(shift_quantors, status(thm), [f8])).
% 0.54/0.54 fof(f10,negated_conjecture,((~q(VAR0)|p(VAR0))&(((p(VAR1)|q(VAR1))&(p(VAR1)|~p(skf5)))&((~p(skf4)|q(VAR1))&(~p(skf4)|~p(skf5))))),inference(distribute, status(thm), [f9])).
% 0.54/0.54 cnf(cnf1,negated_conjecture,p(X2)|q(X2),inference(split_conjunct, status(thm), [f10])).
% 0.54/0.54 cnf(c0,plain,p(X3),inference(resolution, status(thm), [cnf1, cnf0])).
% 0.54/0.54 fof(prove_this,conjecture,(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B))))))),input).
% 0.54/0.55 fof(f1,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.54/0.55 fof(f4,negated_conjecture,(~(![A]:(![B]:((![Y]:(q(Y)=>p(Y)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.54/0.55 fof(f5,negated_conjecture,(?[A]:(?[B]:((![Y]:(~q(Y)|p(Y)))&(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(fof_nnf, status(thm), [f4])).
% 0.54/0.55 fof(f6,negated_conjecture,((![Y]:(~q(Y)|p(Y)))&(?[A]:(?[B]:(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(shift_quantors, status(thm), [f5])).
% 0.54/0.55 fof(f7,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(?[VAR3]:(?[VAR2]:(![VAR1]:((p(VAR1)&~p(VAR3))|(q(VAR1)&~p(VAR2))))))),inference(variable_rename, status(thm), [f6])).
% 0.54/0.55 fof(f8,negated_conjecture,((![VAR0]:(~q(VAR0)|p(VAR0)))&(![VAR1]:((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5))))),inference(skolemize, status(esa), [f7])).
% 0.54/0.55 fof(f9,negated_conjecture,((~q(VAR0)|p(VAR0))&((p(VAR1)&~p(skf4))|(q(VAR1)&~p(skf5)))),inference(shift_quantors, status(thm), [f8])).
% 0.54/0.55 fof(f10,negated_conjecture,((~q(VAR0)|p(VAR0))&(((p(VAR1)|q(VAR1))&(p(VAR1)|~p(skf5)))&((~p(skf4)|q(VAR1))&(~p(skf4)|~p(skf5))))),inference(distribute, status(thm), [f9])).
% 0.54/0.55 cnf(cnf4,negated_conjecture,~p(skf4)|~p(skf5),inference(split_conjunct, status(thm), [f10])).
% 0.54/0.55 cnf(c4,plain,~p(skf4),inference(resolution, status(thm), [cnf4, c0])).
% 0.54/0.55 cnf(c7,plain,$false,inference(resolution, status(thm), [c4, c0])).
% 0.54/0.55 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.55 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.55 # Indexed : true
% 0.54/0.55 # Eval function name : PickGiven5
% 0.54/0.55 # Initial clauses : 5
% 0.54/0.55 # Processed clauses : 7
% 0.54/0.55 # Factors computed : 0
% 0.54/0.55 # Resolvents computed: 8
% 0.54/0.55 # Tautologies deleted: 0
% 0.54/0.55 # Forward subsumed : 2
% 0.54/0.55 # Backward subsumed : 6
% 0.54/0.55 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.55 # SZS Expected : Theorem
% 0.54/0.55 # time : 27ms
% 0.54/0.55
%------------------------------------------------------------------------------