TSTP Solution File: SYN980+1 by JavaRes---1.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN980+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 : n022.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.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN980+1 : TPTP v7.5.0. Released v3.1.0.
% 0.07/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.13/0.33 % Computer : n022.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 19:12:13 EST 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.46 # Using default include path : /export/starexec/sandbox/benchmark
% 0.19/0.46 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/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.19/0.46 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.50 # 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.54 # -----------------
% 0.19/0.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54
% 0.19/0.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 fof(prove_this,conjecture,(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))))),input).
% 0.19/0.54 fof(f1,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.54 fof(f4,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.54 fof(f5,negated_conjecture,(?[B]:((![Y]:((r(B)&~r(Y))|p(f(Y),Y)))&(![X]:(![Y]:(~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.54 fof(f6,negated_conjecture,(?[VAR3]:((![VAR0]:((r(VAR3)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(VAR3),VAR3)&~q(VAR2,VAR1))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.54 fof(f7,negated_conjecture,((![VAR0]:((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.54 fof(f8,negated_conjecture,(((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0))&(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.54 fof(f9,negated_conjecture,(((r(skf4)|p(f(VAR0),VAR0))&(~r(VAR0)|p(f(VAR0),VAR0)))&((~p(VAR2,VAR1)|q(f(skf4),skf4))&(~p(VAR2,VAR1)|~q(VAR2,VAR1)))),inference(distribute, status(thm), [f8])).
% 0.19/0.54 cnf(cnf1,negated_conjecture,~r(X3)|p(f(X3),X3),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.54 fof(prove_this,conjecture,(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))))),input).
% 0.19/0.54 fof(f1,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.54 fof(f4,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.54 fof(f5,negated_conjecture,(?[B]:((![Y]:((r(B)&~r(Y))|p(f(Y),Y)))&(![X]:(![Y]:(~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.54 fof(f6,negated_conjecture,(?[VAR3]:((![VAR0]:((r(VAR3)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(VAR3),VAR3)&~q(VAR2,VAR1))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.54 fof(f7,negated_conjecture,((![VAR0]:((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.54 fof(f8,negated_conjecture,(((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0))&(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.54 fof(f9,negated_conjecture,(((r(skf4)|p(f(VAR0),VAR0))&(~r(VAR0)|p(f(VAR0),VAR0)))&((~p(VAR2,VAR1)|q(f(skf4),skf4))&(~p(VAR2,VAR1)|~q(VAR2,VAR1)))),inference(distribute, status(thm), [f8])).
% 0.19/0.54 cnf(cnf0,negated_conjecture,r(skf4)|p(f(X4),X4),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.54 cnf(c0,plain,p(f(X7),X7)|p(f(skf4),skf4),inference(resolution, status(thm), [cnf0, cnf1])).
% 0.19/0.54 cnf(c4,plain,p(f(skf4),skf4),inference(factor, status(thm), [c0])).
% 0.19/0.54 fof(prove_this,conjecture,(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))))),input).
% 0.19/0.54 fof(f1,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.54 fof(f4,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.54 fof(f5,negated_conjecture,(?[B]:((![Y]:((r(B)&~r(Y))|p(f(Y),Y)))&(![X]:(![Y]:(~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.54 fof(f6,negated_conjecture,(?[VAR3]:((![VAR0]:((r(VAR3)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(VAR3),VAR3)&~q(VAR2,VAR1))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.54 fof(f7,negated_conjecture,((![VAR0]:((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.54 fof(f8,negated_conjecture,(((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0))&(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.54 fof(f9,negated_conjecture,(((r(skf4)|p(f(VAR0),VAR0))&(~r(VAR0)|p(f(VAR0),VAR0)))&((~p(VAR2,VAR1)|q(f(skf4),skf4))&(~p(VAR2,VAR1)|~q(VAR2,VAR1)))),inference(distribute, status(thm), [f8])).
% 0.19/0.54 cnf(cnf3,negated_conjecture,~p(X1,X2)|~q(X1,X2),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.54 fof(prove_this,conjecture,(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))))),input).
% 0.19/0.54 fof(f1,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.54 fof(f4,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.54 fof(f5,negated_conjecture,(?[B]:((![Y]:((r(B)&~r(Y))|p(f(Y),Y)))&(![X]:(![Y]:(~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.54 fof(f6,negated_conjecture,(?[VAR3]:((![VAR0]:((r(VAR3)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(VAR3),VAR3)&~q(VAR2,VAR1))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.54 fof(f7,negated_conjecture,((![VAR0]:((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.54 fof(f8,negated_conjecture,(((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0))&(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.54 fof(f9,negated_conjecture,(((r(skf4)|p(f(VAR0),VAR0))&(~r(VAR0)|p(f(VAR0),VAR0)))&((~p(VAR2,VAR1)|q(f(skf4),skf4))&(~p(VAR2,VAR1)|~q(VAR2,VAR1)))),inference(distribute, status(thm), [f8])).
% 0.19/0.54 cnf(cnf2,negated_conjecture,~p(X5,X6)|q(f(skf4),skf4),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.54 fof(prove_this,conjecture,(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))))),input).
% 0.19/0.54 fof(f1,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.54 fof(f4,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.54 fof(f5,negated_conjecture,(?[B]:((![Y]:((r(B)&~r(Y))|p(f(Y),Y)))&(![X]:(![Y]:(~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.54 fof(f6,negated_conjecture,(?[VAR3]:((![VAR0]:((r(VAR3)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(VAR3),VAR3)&~q(VAR2,VAR1))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.54 fof(f7,negated_conjecture,((![VAR0]:((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.54 fof(f8,negated_conjecture,(((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0))&(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.54 fof(f9,negated_conjecture,(((r(skf4)|p(f(VAR0),VAR0))&(~r(VAR0)|p(f(VAR0),VAR0)))&((~p(VAR2,VAR1)|q(f(skf4),skf4))&(~p(VAR2,VAR1)|~q(VAR2,VAR1)))),inference(distribute, status(thm), [f8])).
% 0.19/0.54 cnf(cnf1,negated_conjecture,~r(X3)|p(f(X3),X3),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.54 fof(prove_this,conjecture,(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y))))))),input).
% 0.19/0.54 fof(f1,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(assume_negation, status(cth), [prove_this])).
% 0.19/0.54 fof(f4,negated_conjecture,(~(![B]:((![Y]:((r(B)=>r(Y))=>p(f(Y),Y)))=>(?[X]:(?[Y]:(p(X,Y)&(q(f(B),B)=>q(X,Y)))))))),inference(fof_simplification, status(thm), [f1])).
% 0.19/0.54 fof(f5,negated_conjecture,(?[B]:((![Y]:((r(B)&~r(Y))|p(f(Y),Y)))&(![X]:(![Y]:(~p(X,Y)|(q(f(B),B)&~q(X,Y))))))),inference(fof_nnf, status(thm), [f4])).
% 0.19/0.54 fof(f6,negated_conjecture,(?[VAR3]:((![VAR0]:((r(VAR3)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(VAR3),VAR3)&~q(VAR2,VAR1))))))),inference(variable_rename, status(thm), [f5])).
% 0.19/0.54 fof(f7,negated_conjecture,((![VAR0]:((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0)))&(![VAR2]:(![VAR1]:(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))))),inference(skolemize, status(esa), [f6])).
% 0.19/0.54 fof(f8,negated_conjecture,(((r(skf4)&~r(VAR0))|p(f(VAR0),VAR0))&(~p(VAR2,VAR1)|(q(f(skf4),skf4)&~q(VAR2,VAR1)))),inference(shift_quantors, status(thm), [f7])).
% 0.19/0.54 fof(f9,negated_conjecture,(((r(skf4)|p(f(VAR0),VAR0))&(~r(VAR0)|p(f(VAR0),VAR0)))&((~p(VAR2,VAR1)|q(f(skf4),skf4))&(~p(VAR2,VAR1)|~q(VAR2,VAR1)))),inference(distribute, status(thm), [f8])).
% 0.19/0.54 cnf(cnf0,negated_conjecture,r(skf4)|p(f(X4),X4),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.54 cnf(c0,plain,p(f(X7),X7)|p(f(skf4),skf4),inference(resolution, status(thm), [cnf0, cnf1])).
% 0.19/0.54 cnf(c4,plain,p(f(skf4),skf4),inference(factor, status(thm), [c0])).
% 0.19/0.54 cnf(c7,plain,q(f(skf4),skf4),inference(resolution, status(thm), [c4, cnf2])).
% 0.19/0.54 cnf(c8,plain,~p(f(skf4),skf4),inference(resolution, status(thm), [c7, cnf3])).
% 0.19/0.54 cnf(c12,plain,$false,inference(resolution, status(thm), [c8, c4])).
% 0.19/0.54 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # Filename : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # Indexed : true
% 0.19/0.54 # Eval function name : PickGiven5
% 0.19/0.54 # Initial clauses : 4
% 0.19/0.54 # Processed clauses : 9
% 0.19/0.54 # Factors computed : 1
% 0.19/0.54 # Resolvents computed: 12
% 0.19/0.54 # Tautologies deleted: 0
% 0.19/0.54 # Forward subsumed : 0
% 0.19/0.54 # Backward subsumed : 3
% 0.19/0.54 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # SZS Expected : Theorem
% 0.19/0.54 # time : 30ms
% 0.19/0.54
%------------------------------------------------------------------------------