TSTP Solution File: SYN934+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN934+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 : n016.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.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN934+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 : n016.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:16:28 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.19/0.55 # -----------------
% 0.19/0.55 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55
% 0.19/0.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 fof(prove_this,conjecture,((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X)))),input).
% 0.19/0.55 fof(f1,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.55 fof(f4,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.55 fof(f5,negated_conjecture,(((![X]:(c&~p(X)))|(c&(![X]:~p(X))))&((?[X]:(~c|p(X)))|(~c|(?[X]:p(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.55 fof(f6,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((?[VAR2]:(~c|p(VAR2)))|(~c|(?[VAR3]:p(VAR3))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.55 fof(f7,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(skolemize, status(esa), [f6])).
% 0.19/0.55 fof(f8,negated_conjecture,(((c&~p(VAR0))|(c&~p(VAR1)))&((~c|p(skf4))|(~c|p(skf5)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.55 fof(f9,negated_conjecture,((((c|c)&(c|~p(VAR1)))&((~p(VAR0)|c)&(~p(VAR0)|~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(distribute, status(thm), [f8])).
% 0.19/0.55 cnf(cnf3,negated_conjecture,~p(X3)|~p(X4),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.55 cnf(c1,plain,~p(X5),inference(factor, status(thm), [cnf3])).
% 0.19/0.55 fof(prove_this,conjecture,((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X)))),input).
% 0.19/0.55 fof(f1,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.55 fof(f4,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.55 fof(f5,negated_conjecture,(((![X]:(c&~p(X)))|(c&(![X]:~p(X))))&((?[X]:(~c|p(X)))|(~c|(?[X]:p(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.55 fof(f6,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((?[VAR2]:(~c|p(VAR2)))|(~c|(?[VAR3]:p(VAR3))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.55 fof(f7,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(skolemize, status(esa), [f6])).
% 0.19/0.55 fof(f8,negated_conjecture,(((c&~p(VAR0))|(c&~p(VAR1)))&((~c|p(skf4))|(~c|p(skf5)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.55 fof(f9,negated_conjecture,((((c|c)&(c|~p(VAR1)))&((~p(VAR0)|c)&(~p(VAR0)|~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(distribute, status(thm), [f8])).
% 0.19/0.55 cnf(cnf3,negated_conjecture,~p(X3)|~p(X4),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.55 cnf(c1,plain,~p(X5),inference(factor, status(thm), [cnf3])).
% 0.19/0.55 fof(prove_this,conjecture,((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X)))),input).
% 0.19/0.55 fof(f1,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.55 fof(f4,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.55 fof(f5,negated_conjecture,(((![X]:(c&~p(X)))|(c&(![X]:~p(X))))&((?[X]:(~c|p(X)))|(~c|(?[X]:p(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.55 fof(f6,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((?[VAR2]:(~c|p(VAR2)))|(~c|(?[VAR3]:p(VAR3))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.55 fof(f7,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(skolemize, status(esa), [f6])).
% 0.19/0.55 fof(f8,negated_conjecture,(((c&~p(VAR0))|(c&~p(VAR1)))&((~c|p(skf4))|(~c|p(skf5)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.55 fof(f9,negated_conjecture,((((c|c)&(c|~p(VAR1)))&((~p(VAR0)|c)&(~p(VAR0)|~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(distribute, status(thm), [f8])).
% 0.19/0.55 cnf(cnf0,negated_conjecture,c|c,inference(split_conjunct, status(thm), [f9])).
% 0.19/0.55 cnf(c0,plain,c,inference(factor, status(thm), [cnf0])).
% 0.19/0.55 fof(prove_this,conjecture,((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X)))),input).
% 0.19/0.55 fof(f1,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.55 fof(f4,negated_conjecture,(~((?[X]:(c=>p(X)))<=>(c=>(?[X]:p(X))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.56 fof(f5,negated_conjecture,(((![X]:(c&~p(X)))|(c&(![X]:~p(X))))&((?[X]:(~c|p(X)))|(~c|(?[X]:p(X))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.56 fof(f6,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((?[VAR2]:(~c|p(VAR2)))|(~c|(?[VAR3]:p(VAR3))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.56 fof(f7,negated_conjecture,(((![VAR0]:(c&~p(VAR0)))|(c&(![VAR1]:~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(skolemize, status(esa), [f6])).
% 0.19/0.56 fof(f8,negated_conjecture,(((c&~p(VAR0))|(c&~p(VAR1)))&((~c|p(skf4))|(~c|p(skf5)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.56 fof(f9,negated_conjecture,((((c|c)&(c|~p(VAR1)))&((~p(VAR0)|c)&(~p(VAR0)|~p(VAR1))))&((~c|p(skf4))|(~c|p(skf5)))),inference(distribute, status(thm), [f8])).
% 0.19/0.56 cnf(cnf4,negated_conjecture,~c|p(skf4)|~c|p(skf5),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.56 cnf(c3,plain,p(skf4)|p(skf5),inference(resolution, status(thm), [cnf4, c0])).
% 0.19/0.56 cnf(c4,plain,p(skf5),inference(resolution, status(thm), [c3, c1])).
% 0.19/0.56 cnf(c6,plain,$false,inference(resolution, status(thm), [c4, c1])).
% 0.19/0.56 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.56 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.56 # Indexed : true
% 0.19/0.56 # Eval function name : PickGiven5
% 0.19/0.56 # Initial clauses : 5
% 0.19/0.56 # Processed clauses : 7
% 0.19/0.56 # Factors computed : 3
% 0.19/0.56 # Resolvents computed: 4
% 0.19/0.56 # Tautologies deleted: 0
% 0.19/0.56 # Forward subsumed : 2
% 0.19/0.56 # Backward subsumed : 5
% 0.19/0.56 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.56 # SZS Expected : Theorem
% 0.19/0.56 # time : 40ms
% 0.19/0.56
%------------------------------------------------------------------------------