TSTP Solution File: SYN924+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN924+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 : n006.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:49 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN924+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.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % RAMPerCPU : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Mar 10 17:38:00 EST 2022
% 0.14/0.34 % 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.20/0.56 # -----------------
% 0.20/0.56 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.56
% 0.20/0.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.57 fof(prove_this,conjecture,((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X)))),input).
% 0.20/0.57 fof(f1,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.57 fof(f4,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.57 fof(f5,negated_conjecture,(((![X]:(~p(X)&~q(X)))|((![X]:~p(X))&(![X]:~q(X))))&((?[X]:(p(X)|q(X)))|((?[X]:p(X))|(?[X]:q(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.57 fof(f6,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((?[VAR3]:(p(VAR3)|q(VAR3)))|((?[VAR4]:p(VAR4))|(?[VAR5]:q(VAR5))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.57 fof(f7,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.57 fof(f8,negated_conjecture,(((~p(VAR0)&~q(VAR0))|(~p(VAR1)&~q(VAR2)))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.57 fof(f9,negated_conjecture,((((~p(VAR0)|~p(VAR1))&(~p(VAR0)|~q(VAR2)))&((~q(VAR0)|~p(VAR1))&(~q(VAR0)|~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(distribute, status(thm), [f8])).
% 0.20/0.57 cnf(cnf3,negated_conjecture,~q(X8)|~q(X9),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.57 cnf(c1,plain,~q(X10),inference(factor, status(thm), [cnf3])).
% 0.20/0.57 fof(prove_this,conjecture,((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X)))),input).
% 0.20/0.57 fof(f1,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.57 fof(f4,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.57 fof(f5,negated_conjecture,(((![X]:(~p(X)&~q(X)))|((![X]:~p(X))&(![X]:~q(X))))&((?[X]:(p(X)|q(X)))|((?[X]:p(X))|(?[X]:q(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.57 fof(f6,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((?[VAR3]:(p(VAR3)|q(VAR3)))|((?[VAR4]:p(VAR4))|(?[VAR5]:q(VAR5))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.57 fof(f7,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.57 fof(f8,negated_conjecture,(((~p(VAR0)&~q(VAR0))|(~p(VAR1)&~q(VAR2)))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.57 fof(f9,negated_conjecture,((((~p(VAR0)|~p(VAR1))&(~p(VAR0)|~q(VAR2)))&((~q(VAR0)|~p(VAR1))&(~q(VAR0)|~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(distribute, status(thm), [f8])).
% 0.20/0.57 cnf(cnf0,negated_conjecture,~p(X1)|~p(X2),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.57 cnf(c0,plain,~p(X3),inference(factor, status(thm), [cnf0])).
% 0.20/0.57 fof(prove_this,conjecture,((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X)))),input).
% 0.20/0.57 fof(f1,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.57 fof(f4,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.57 fof(f5,negated_conjecture,(((![X]:(~p(X)&~q(X)))|((![X]:~p(X))&(![X]:~q(X))))&((?[X]:(p(X)|q(X)))|((?[X]:p(X))|(?[X]:q(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.57 fof(f6,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((?[VAR3]:(p(VAR3)|q(VAR3)))|((?[VAR4]:p(VAR4))|(?[VAR5]:q(VAR5))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.57 fof(f7,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.57 fof(f8,negated_conjecture,(((~p(VAR0)&~q(VAR0))|(~p(VAR1)&~q(VAR2)))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.57 fof(f9,negated_conjecture,((((~p(VAR0)|~p(VAR1))&(~p(VAR0)|~q(VAR2)))&((~q(VAR0)|~p(VAR1))&(~q(VAR0)|~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(distribute, status(thm), [f8])).
% 0.20/0.57 cnf(cnf3,negated_conjecture,~q(X8)|~q(X9),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.57 cnf(c1,plain,~q(X10),inference(factor, status(thm), [cnf3])).
% 0.20/0.57 fof(prove_this,conjecture,((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X)))),input).
% 0.20/0.57 fof(f1,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.57 fof(f4,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.57 fof(f5,negated_conjecture,(((![X]:(~p(X)&~q(X)))|((![X]:~p(X))&(![X]:~q(X))))&((?[X]:(p(X)|q(X)))|((?[X]:p(X))|(?[X]:q(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.57 fof(f6,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((?[VAR3]:(p(VAR3)|q(VAR3)))|((?[VAR4]:p(VAR4))|(?[VAR5]:q(VAR5))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.57 fof(f7,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.57 fof(f8,negated_conjecture,(((~p(VAR0)&~q(VAR0))|(~p(VAR1)&~q(VAR2)))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.57 fof(f9,negated_conjecture,((((~p(VAR0)|~p(VAR1))&(~p(VAR0)|~q(VAR2)))&((~q(VAR0)|~p(VAR1))&(~q(VAR0)|~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(distribute, status(thm), [f8])).
% 0.20/0.57 cnf(cnf0,negated_conjecture,~p(X1)|~p(X2),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.57 cnf(c0,plain,~p(X3),inference(factor, status(thm), [cnf0])).
% 0.20/0.57 fof(prove_this,conjecture,((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X)))),input).
% 0.20/0.57 fof(f1,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.57 fof(f4,negated_conjecture,(~((?[X]:(p(X)|q(X)))<=>((?[X]:p(X))|(?[X]:q(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.57 fof(f5,negated_conjecture,(((![X]:(~p(X)&~q(X)))|((![X]:~p(X))&(![X]:~q(X))))&((?[X]:(p(X)|q(X)))|((?[X]:p(X))|(?[X]:q(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.57 fof(f6,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((?[VAR3]:(p(VAR3)|q(VAR3)))|((?[VAR4]:p(VAR4))|(?[VAR5]:q(VAR5))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.57 fof(f7,negated_conjecture,(((![VAR0]:(~p(VAR0)&~q(VAR0)))|((![VAR1]:~p(VAR1))&(![VAR2]:~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.57 fof(f8,negated_conjecture,(((~p(VAR0)&~q(VAR0))|(~p(VAR1)&~q(VAR2)))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.57 fof(f9,negated_conjecture,((((~p(VAR0)|~p(VAR1))&(~p(VAR0)|~q(VAR2)))&((~q(VAR0)|~p(VAR1))&(~q(VAR0)|~q(VAR2))))&((p(skf6)|q(skf6))|(p(skf7)|q(skf8)))),inference(distribute, status(thm), [f8])).
% 0.20/0.57 cnf(cnf4,negated_conjecture,p(skf6)|q(skf6)|p(skf7)|q(skf8),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.57 cnf(c2,plain,q(skf6)|p(skf7)|q(skf8),inference(resolution, status(thm), [cnf4, c0])).
% 0.20/0.57 cnf(c9,plain,p(skf7)|q(skf8),inference(resolution, status(thm), [c2, c1])).
% 0.20/0.57 cnf(c13,plain,q(skf8),inference(resolution, status(thm), [c9, c0])).
% 0.20/0.57 cnf(c17,plain,$false,inference(resolution, status(thm), [c13, c1])).
% 0.20/0.57 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.57 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.57 # Indexed : true
% 0.20/0.57 # Eval function name : PickGiven5
% 0.20/0.57 # Initial clauses : 5
% 0.20/0.57 # Processed clauses : 8
% 0.20/0.57 # Factors computed : 2
% 0.20/0.57 # Resolvents computed: 16
% 0.20/0.57 # Tautologies deleted: 0
% 0.20/0.57 # Forward subsumed : 2
% 0.20/0.57 # Backward subsumed : 8
% 0.20/0.57 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.57 # SZS Expected : Theorem
% 0.20/0.57 # time : 50ms
% 0.20/0.57
%------------------------------------------------------------------------------