TSTP Solution File: SYN962+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN962+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 : n012.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:55 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN962+1 : TPTP v7.5.0. Released v3.1.0.
% 0.12/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 : n012.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:25:20 EST 2022
% 0.13/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.50 # hasConjecture: true isFOF: true
% 0.20/0.50 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.50 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.52 # -----------------
% 0.20/0.52 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52
% 0.20/0.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 fof(prove_this,conjecture,((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y)))),input).
% 0.20/0.52 fof(f1,negated_conjecture,(~((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.52 fof(f4,negated_conjecture,(~((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.52 fof(f5,negated_conjecture,((![X]:p(X))&((?[X]:~p(X))|(?[Y]:~p(Y)))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.52 fof(f6,negated_conjecture,((![VAR0]:p(VAR0))&((?[VAR1]:~p(VAR1))|(?[VAR2]:~p(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.52 fof(f7,negated_conjecture,((![VAR0]:p(VAR0))&(~p(skf3)|~p(skf4))),inference(skolemize, status(esa), [f6])).
% 0.20/0.52 fof(f8,negated_conjecture,(p(VAR0)&(~p(skf3)|~p(skf4))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.52 fof(f9,negated_conjecture,(p(VAR0)&(~p(skf3)|~p(skf4))),inference(distribute, status(thm), [f8])).
% 0.20/0.52 cnf(cnf0,negated_conjecture,p(X1),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.52 fof(prove_this,conjecture,((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y)))),input).
% 0.20/0.52 fof(f1,negated_conjecture,(~((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.52 fof(f4,negated_conjecture,(~((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.52 fof(f5,negated_conjecture,((![X]:p(X))&((?[X]:~p(X))|(?[Y]:~p(Y)))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.52 fof(f6,negated_conjecture,((![VAR0]:p(VAR0))&((?[VAR1]:~p(VAR1))|(?[VAR2]:~p(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.52 fof(f7,negated_conjecture,((![VAR0]:p(VAR0))&(~p(skf3)|~p(skf4))),inference(skolemize, status(esa), [f6])).
% 0.20/0.52 fof(f8,negated_conjecture,(p(VAR0)&(~p(skf3)|~p(skf4))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.52 fof(f9,negated_conjecture,(p(VAR0)&(~p(skf3)|~p(skf4))),inference(distribute, status(thm), [f8])).
% 0.20/0.52 cnf(cnf0,negated_conjecture,p(X1),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.52 fof(prove_this,conjecture,((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y)))),input).
% 0.20/0.52 fof(f1,negated_conjecture,(~((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.52 fof(f4,negated_conjecture,(~((![X]:p(X))=>((![X]:p(X))&(![Y]:p(Y))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.52 fof(f5,negated_conjecture,((![X]:p(X))&((?[X]:~p(X))|(?[Y]:~p(Y)))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.52 fof(f6,negated_conjecture,((![VAR0]:p(VAR0))&((?[VAR1]:~p(VAR1))|(?[VAR2]:~p(VAR2)))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.52 fof(f7,negated_conjecture,((![VAR0]:p(VAR0))&(~p(skf3)|~p(skf4))),inference(skolemize, status(esa), [f6])).
% 0.20/0.52 fof(f8,negated_conjecture,(p(VAR0)&(~p(skf3)|~p(skf4))),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.52 fof(f9,negated_conjecture,(p(VAR0)&(~p(skf3)|~p(skf4))),inference(distribute, status(thm), [f8])).
% 0.20/0.52 cnf(cnf1,negated_conjecture,~p(skf3)|~p(skf4),inference(split_conjunct, status(thm), [f9])).
% 0.20/0.52 cnf(c0,plain,~p(skf3),inference(resolution, status(thm), [cnf1, cnf0])).
% 0.20/0.52 cnf(c1,plain,$false,inference(resolution, status(thm), [c0, cnf0])).
% 0.20/0.52 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 # Indexed : true
% 0.20/0.52 # Eval function name : PickGiven5
% 0.20/0.52 # Initial clauses : 2
% 0.20/0.52 # Processed clauses : 3
% 0.20/0.52 # Factors computed : 0
% 0.20/0.52 # Resolvents computed: 2
% 0.20/0.52 # Tautologies deleted: 0
% 0.20/0.52 # Forward subsumed : 0
% 0.20/0.52 # Backward subsumed : 1
% 0.20/0.52 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 # SZS Expected : Theorem
% 0.20/0.52 # time : 10ms
% 0.20/0.52
%------------------------------------------------------------------------------