TSTP Solution File: SYN979+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN979+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 : n002.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:58 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.03/0.12 % Problem : SYN979+1 : TPTP v7.5.0. Released v3.1.0.
% 0.03/0.13 % 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.14/0.34 % Computer : n002.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 19:17:08 EST 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.47 # Using default include path : /export/starexec/sandbox/benchmark
% 0.20/0.48 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # 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.20/0.48 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.20/0.53 # hasConjecture: true isFOF: true
% 0.20/0.54 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.54 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.20/0.56 # -----------------
% 0.20/0.56 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56
% 0.20/0.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 fof(prove_this,conjecture,(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B)))))),input).
% 0.20/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B))))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(![X]:(![Y]:(((((((((~q(X)|p(X,A))&q(A))&q(B))&(~r(Y)|p(B,Y)))&r(A))&r(B))&(~s(A)|p(X,Y)))&s(A))&~p(A,B)))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.56 fof(f6,negated_conjecture,(?[VAR3]:(?[VAR2]:(![VAR1]:(![VAR0]:(((((((((~q(VAR1)|p(VAR1,VAR3))&q(VAR3))&q(VAR2))&(~r(VAR0)|p(VAR2,VAR0)))&r(VAR3))&r(VAR2))&(~s(VAR3)|p(VAR1,VAR0)))&s(VAR3))&~p(VAR3,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.56 fof(f7,negated_conjecture,(![VAR1]:(![VAR0]:(((((((((~q(VAR1)|p(VAR1,skf4))&q(skf4))&q(skf5))&(~r(VAR0)|p(skf5,VAR0)))&r(skf4))&r(skf5))&(~s(skf4)|p(VAR1,VAR0)))&s(skf4))&~p(skf4,skf5)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.56 fof(f8,negated_conjecture,(((((((((~q(VAR1)|p(VAR1,skf4))&q(skf4))&q(skf5))&(~r(VAR0)|p(skf5,VAR0)))&r(skf4))&r(skf5))&(~s(skf4)|p(VAR1,VAR0)))&s(skf4))&~p(skf4,skf5)),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.56 cnf(cnf8,negated_conjecture,~p(skf4,skf5),inference(split_conjunct, status(thm), [f8])).
% 0.20/0.56 fof(prove_this,conjecture,(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B)))))),input).
% 0.20/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B))))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(![X]:(![Y]:(((((((((~q(X)|p(X,A))&q(A))&q(B))&(~r(Y)|p(B,Y)))&r(A))&r(B))&(~s(A)|p(X,Y)))&s(A))&~p(A,B)))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.56 fof(f6,negated_conjecture,(?[VAR3]:(?[VAR2]:(![VAR1]:(![VAR0]:(((((((((~q(VAR1)|p(VAR1,VAR3))&q(VAR3))&q(VAR2))&(~r(VAR0)|p(VAR2,VAR0)))&r(VAR3))&r(VAR2))&(~s(VAR3)|p(VAR1,VAR0)))&s(VAR3))&~p(VAR3,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.56 fof(f7,negated_conjecture,(![VAR1]:(![VAR0]:(((((((((~q(VAR1)|p(VAR1,skf4))&q(skf4))&q(skf5))&(~r(VAR0)|p(skf5,VAR0)))&r(skf4))&r(skf5))&(~s(skf4)|p(VAR1,VAR0)))&s(skf4))&~p(skf4,skf5)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.56 fof(f8,negated_conjecture,(((((((((~q(VAR1)|p(VAR1,skf4))&q(skf4))&q(skf5))&(~r(VAR0)|p(skf5,VAR0)))&r(skf4))&r(skf5))&(~s(skf4)|p(VAR1,VAR0)))&s(skf4))&~p(skf4,skf5)),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.56 cnf(cnf7,negated_conjecture,s(skf4),inference(split_conjunct, status(thm), [f8])).
% 0.20/0.56 fof(prove_this,conjecture,(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B)))))),input).
% 0.20/0.56 fof(f1,negated_conjecture,(~(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.20/0.56 fof(f4,negated_conjecture,(~(![A]:(![B]:(?[X]:(?[Y]:(((((((((q(X)=>p(X,A))&q(A))&q(B))&(r(Y)=>p(B,Y)))&r(A))&r(B))&(s(A)=>p(X,Y)))&s(A))=>p(A,B))))))),inference(fof_simplification, status(thm), [f1])).
% 0.20/0.56 fof(f5,negated_conjecture,(?[A]:(?[B]:(![X]:(![Y]:(((((((((~q(X)|p(X,A))&q(A))&q(B))&(~r(Y)|p(B,Y)))&r(A))&r(B))&(~s(A)|p(X,Y)))&s(A))&~p(A,B)))))),inference(fof_nnf, status(thm), [f4])).
% 0.20/0.56 fof(f6,negated_conjecture,(?[VAR3]:(?[VAR2]:(![VAR1]:(![VAR0]:(((((((((~q(VAR1)|p(VAR1,VAR3))&q(VAR3))&q(VAR2))&(~r(VAR0)|p(VAR2,VAR0)))&r(VAR3))&r(VAR2))&(~s(VAR3)|p(VAR1,VAR0)))&s(VAR3))&~p(VAR3,VAR2)))))),inference(variable_rename, status(thm), [f5])).
% 0.20/0.56 fof(f7,negated_conjecture,(![VAR1]:(![VAR0]:(((((((((~q(VAR1)|p(VAR1,skf4))&q(skf4))&q(skf5))&(~r(VAR0)|p(skf5,VAR0)))&r(skf4))&r(skf5))&(~s(skf4)|p(VAR1,VAR0)))&s(skf4))&~p(skf4,skf5)))),inference(skolemize, status(esa), [f6])).
% 0.20/0.56 fof(f8,negated_conjecture,(((((((((~q(VAR1)|p(VAR1,skf4))&q(skf4))&q(skf5))&(~r(VAR0)|p(skf5,VAR0)))&r(skf4))&r(skf5))&(~s(skf4)|p(VAR1,VAR0)))&s(skf4))&~p(skf4,skf5)),inference(shift_quantors, status(thm), [f7])).
% 0.20/0.56 cnf(cnf6,negated_conjecture,~s(skf4)|p(X3,X4),inference(split_conjunct, status(thm), [f8])).
% 0.20/0.56 cnf(c4,plain,p(X5,X6),inference(resolution, status(thm), [cnf6, cnf7])).
% 0.20/0.56 cnf(c5,plain,$false,inference(resolution, status(thm), [c4, cnf8])).
% 0.20/0.56 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 # Indexed : true
% 0.20/0.56 # Eval function name : PickGiven5
% 0.20/0.56 # Initial clauses : 9
% 0.20/0.56 # Processed clauses : 13
% 0.20/0.56 # Factors computed : 0
% 0.20/0.56 # Resolvents computed: 6
% 0.20/0.56 # Tautologies deleted: 0
% 0.20/0.56 # Forward subsumed : 0
% 0.20/0.56 # Backward subsumed : 6
% 0.20/0.56 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 # SZS Expected : Theorem
% 0.20/0.56 # time : 17ms
% 0.20/0.56
%------------------------------------------------------------------------------