TSTP Solution File: SYN930+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN930+1 : TPTP v7.5.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n010.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:50 EDT 2022
% Result : Theorem 0.17s 0.54s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN930+1 : TPTP v7.5.0. Released v3.1.0.
% 0.03/0.12 % Command : java -Xmx15G -cp /export/starexec/sandbox/solver/bin atp.ProverFOF -i /export/starexec/sandbox/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % RAMPerCPU : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Mar 10 17:38:37 EST 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.45 # Using default include path : /export/starexec/sandbox/benchmark
% 0.17/0.46 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.46 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.46 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.17/0.46 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.17/0.50 # hasConjecture: true isFOF: true
% 0.17/0.50 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.17/0.50 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.17/0.54 # -----------------
% 0.17/0.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.54
% 0.17/0.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.54 fof(prove_this,conjecture,((![X]:(p(X)|c))<=>((![X]:p(X))|c)),input).
% 0.17/0.54 fof(f1,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(assume_negation, status(cth), [prove_this])).
% 0.17/0.54 fof(f4,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(fof_simplification, status(thm), [f1])).
% 0.17/0.54 fof(f5,negated_conjecture,(((?[X]:(~p(X)&~c))|((?[X]:~p(X))&~c))&((![X]:(p(X)|c))|((![X]:p(X))|c))),inference(fof_nnf, status(thm), [f4])).
% 0.17/0.54 fof(f6,negated_conjecture,(((?[VAR0]:(~p(VAR0)&~c))|((?[VAR1]:~p(VAR1))&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(variable_rename, status(thm), [f5])).
% 0.17/0.54 fof(f7,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(skolemize, status(esa), [f6])).
% 0.17/0.55 fof(f8,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((p(VAR2)|c)|(p(VAR3)|c))),inference(shift_quantors, status(thm), [f7])).
% 0.17/0.55 fof(f9,negated_conjecture,((((~p(skf4)|~p(skf5))&(~p(skf4)|~c))&((~c|~p(skf5))&(~c|~c)))&((p(VAR2)|c)|(p(VAR3)|c))),inference(distribute, status(thm), [f8])).
% 0.17/0.55 cnf(cnf3,negated_conjecture,~c|~c,inference(split_conjunct, status(thm), [f9])).
% 0.17/0.55 cnf(c0,plain,~c,inference(factor, status(thm), [cnf3])).
% 0.17/0.55 fof(prove_this,conjecture,((![X]:(p(X)|c))<=>((![X]:p(X))|c)),input).
% 0.17/0.55 fof(f1,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(assume_negation, status(cth), [prove_this])).
% 0.17/0.55 fof(f4,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(fof_simplification, status(thm), [f1])).
% 0.17/0.55 fof(f5,negated_conjecture,(((?[X]:(~p(X)&~c))|((?[X]:~p(X))&~c))&((![X]:(p(X)|c))|((![X]:p(X))|c))),inference(fof_nnf, status(thm), [f4])).
% 0.17/0.55 fof(f6,negated_conjecture,(((?[VAR0]:(~p(VAR0)&~c))|((?[VAR1]:~p(VAR1))&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(variable_rename, status(thm), [f5])).
% 0.17/0.55 fof(f7,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(skolemize, status(esa), [f6])).
% 0.17/0.55 fof(f8,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((p(VAR2)|c)|(p(VAR3)|c))),inference(shift_quantors, status(thm), [f7])).
% 0.17/0.55 fof(f9,negated_conjecture,((((~p(skf4)|~p(skf5))&(~p(skf4)|~c))&((~c|~p(skf5))&(~c|~c)))&((p(VAR2)|c)|(p(VAR3)|c))),inference(distribute, status(thm), [f8])).
% 0.17/0.55 cnf(cnf4,negated_conjecture,p(X1)|c|p(X2)|c,inference(split_conjunct, status(thm), [f9])).
% 0.17/0.55 cnf(c1,plain,p(X3)|c,inference(factor, status(thm), [cnf4])).
% 0.17/0.55 cnf(c8,plain,p(X4),inference(resolution, status(thm), [c1, c0])).
% 0.17/0.55 fof(prove_this,conjecture,((![X]:(p(X)|c))<=>((![X]:p(X))|c)),input).
% 0.17/0.55 fof(f1,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(assume_negation, status(cth), [prove_this])).
% 0.17/0.55 fof(f4,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(fof_simplification, status(thm), [f1])).
% 0.17/0.55 fof(f5,negated_conjecture,(((?[X]:(~p(X)&~c))|((?[X]:~p(X))&~c))&((![X]:(p(X)|c))|((![X]:p(X))|c))),inference(fof_nnf, status(thm), [f4])).
% 0.17/0.55 fof(f6,negated_conjecture,(((?[VAR0]:(~p(VAR0)&~c))|((?[VAR1]:~p(VAR1))&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(variable_rename, status(thm), [f5])).
% 0.17/0.55 fof(f7,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(skolemize, status(esa), [f6])).
% 0.17/0.55 fof(f8,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((p(VAR2)|c)|(p(VAR3)|c))),inference(shift_quantors, status(thm), [f7])).
% 0.17/0.55 fof(f9,negated_conjecture,((((~p(skf4)|~p(skf5))&(~p(skf4)|~c))&((~c|~p(skf5))&(~c|~c)))&((p(VAR2)|c)|(p(VAR3)|c))),inference(distribute, status(thm), [f8])).
% 0.17/0.55 cnf(cnf0,negated_conjecture,~p(skf4)|~p(skf5),inference(split_conjunct, status(thm), [f9])).
% 0.17/0.55 fof(prove_this,conjecture,((![X]:(p(X)|c))<=>((![X]:p(X))|c)),input).
% 0.17/0.55 fof(f1,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(assume_negation, status(cth), [prove_this])).
% 0.17/0.55 fof(f4,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(fof_simplification, status(thm), [f1])).
% 0.17/0.55 fof(f5,negated_conjecture,(((?[X]:(~p(X)&~c))|((?[X]:~p(X))&~c))&((![X]:(p(X)|c))|((![X]:p(X))|c))),inference(fof_nnf, status(thm), [f4])).
% 0.17/0.55 fof(f6,negated_conjecture,(((?[VAR0]:(~p(VAR0)&~c))|((?[VAR1]:~p(VAR1))&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(variable_rename, status(thm), [f5])).
% 0.17/0.55 fof(f7,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(skolemize, status(esa), [f6])).
% 0.17/0.55 fof(f8,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((p(VAR2)|c)|(p(VAR3)|c))),inference(shift_quantors, status(thm), [f7])).
% 0.17/0.55 fof(f9,negated_conjecture,((((~p(skf4)|~p(skf5))&(~p(skf4)|~c))&((~c|~p(skf5))&(~c|~c)))&((p(VAR2)|c)|(p(VAR3)|c))),inference(distribute, status(thm), [f8])).
% 0.17/0.55 cnf(cnf3,negated_conjecture,~c|~c,inference(split_conjunct, status(thm), [f9])).
% 0.17/0.55 cnf(c0,plain,~c,inference(factor, status(thm), [cnf3])).
% 0.17/0.55 fof(prove_this,conjecture,((![X]:(p(X)|c))<=>((![X]:p(X))|c)),input).
% 0.17/0.55 fof(f1,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(assume_negation, status(cth), [prove_this])).
% 0.17/0.55 fof(f4,negated_conjecture,(~((![X]:(p(X)|c))<=>((![X]:p(X))|c))),inference(fof_simplification, status(thm), [f1])).
% 0.17/0.55 fof(f5,negated_conjecture,(((?[X]:(~p(X)&~c))|((?[X]:~p(X))&~c))&((![X]:(p(X)|c))|((![X]:p(X))|c))),inference(fof_nnf, status(thm), [f4])).
% 0.17/0.55 fof(f6,negated_conjecture,(((?[VAR0]:(~p(VAR0)&~c))|((?[VAR1]:~p(VAR1))&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(variable_rename, status(thm), [f5])).
% 0.17/0.55 fof(f7,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((![VAR2]:(p(VAR2)|c))|((![VAR3]:p(VAR3))|c))),inference(skolemize, status(esa), [f6])).
% 0.17/0.55 fof(f8,negated_conjecture,(((~p(skf4)&~c)|(~p(skf5)&~c))&((p(VAR2)|c)|(p(VAR3)|c))),inference(shift_quantors, status(thm), [f7])).
% 0.17/0.55 fof(f9,negated_conjecture,((((~p(skf4)|~p(skf5))&(~p(skf4)|~c))&((~c|~p(skf5))&(~c|~c)))&((p(VAR2)|c)|(p(VAR3)|c))),inference(distribute, status(thm), [f8])).
% 0.17/0.55 cnf(cnf4,negated_conjecture,p(X1)|c|p(X2)|c,inference(split_conjunct, status(thm), [f9])).
% 0.17/0.55 cnf(c1,plain,p(X3)|c,inference(factor, status(thm), [cnf4])).
% 0.17/0.55 cnf(c8,plain,p(X4),inference(resolution, status(thm), [c1, c0])).
% 0.17/0.55 cnf(c9,plain,~p(skf4),inference(resolution, status(thm), [c8, cnf0])).
% 0.17/0.55 cnf(c13,plain,$false,inference(resolution, status(thm), [c9, c8])).
% 0.17/0.55 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.55 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.55 # Indexed : true
% 0.17/0.55 # Eval function name : PickGiven5
% 0.17/0.55 # Initial clauses : 5
% 0.17/0.55 # Processed clauses : 7
% 0.17/0.55 # Factors computed : 3
% 0.17/0.55 # Resolvents computed: 11
% 0.17/0.55 # Tautologies deleted: 0
% 0.17/0.55 # Forward subsumed : 2
% 0.17/0.55 # Backward subsumed : 5
% 0.17/0.55 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.55 # SZS Expected : Theorem
% 0.17/0.55 # time : 40ms
% 0.17/0.55
%------------------------------------------------------------------------------