%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : SYN919+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:48 EDT 2022
% Result : Theorem 0.55s 0.57s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN919+1 : TPTP v7.5.0. Released v3.1.0.
% 0.13/0.14 % 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.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % RAMPerCPU : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Mar 10 17:19:51 EST 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.20/0.49 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # 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.49 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.20/0.54 # 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.55/0.57 # -----------------
% 0.55/0.57 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.57
% 0.55/0.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.57 fof(prove_this,conjecture,(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X))))),input).
% 0.55/0.57 fof(f1,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.55/0.57 fof(f4,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(fof_simplification, status(thm), [f1])).
% 0.55/0.57 fof(f5,negated_conjecture,(((![X]:(![Y]:(~r(X,Y)|r(Y,X))))&(![X]:(![Y]:(![Z]:((~r(X,Y)|~r(Y,Z))|r(X,Z))))))&(?[X]:(?[Y]:(r(X,Y)&~r(X,X))))),inference(fof_nnf, status(thm), [f4])).
% 0.55/0.57 fof(f6,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(?[VAR6]:(?[VAR5]:(r(VAR6,VAR5)&~r(VAR6,VAR6))))),inference(variable_rename, status(thm), [f5])).
% 0.55/0.57 fof(f7,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(r(skf7,skf8)&~r(skf7,skf7))),inference(skolemize, status(esa), [f6])).
% 0.55/0.57 fof(f8,negated_conjecture,(((~r(VAR1,VAR0)|r(VAR0,VAR1))&((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2)))&(r(skf7,skf8)&~r(skf7,skf7))),inference(shift_quantors, status(thm), [f7])).
% 0.55/0.57 cnf(cnf3,negated_conjecture,~r(skf7,skf7),inference(split_conjunct, status(thm), [f8])).
% 0.55/0.57 fof(prove_this,conjecture,(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X))))),input).
% 0.55/0.57 fof(f1,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.55/0.57 fof(f4,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(fof_simplification, status(thm), [f1])).
% 0.55/0.57 fof(f5,negated_conjecture,(((![X]:(![Y]:(~r(X,Y)|r(Y,X))))&(![X]:(![Y]:(![Z]:((~r(X,Y)|~r(Y,Z))|r(X,Z))))))&(?[X]:(?[Y]:(r(X,Y)&~r(X,X))))),inference(fof_nnf, status(thm), [f4])).
% 0.55/0.57 fof(f6,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(?[VAR6]:(?[VAR5]:(r(VAR6,VAR5)&~r(VAR6,VAR6))))),inference(variable_rename, status(thm), [f5])).
% 0.55/0.57 fof(f7,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(r(skf7,skf8)&~r(skf7,skf7))),inference(skolemize, status(esa), [f6])).
% 0.55/0.57 fof(f8,negated_conjecture,(((~r(VAR1,VAR0)|r(VAR0,VAR1))&((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2)))&(r(skf7,skf8)&~r(skf7,skf7))),inference(shift_quantors, status(thm), [f7])).
% 0.55/0.57 cnf(cnf2,negated_conjecture,r(skf7,skf8),inference(split_conjunct, status(thm), [f8])).
% 0.55/0.57 fof(prove_this,conjecture,(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X))))),input).
% 0.55/0.57 fof(f1,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.55/0.58 fof(f4,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(fof_simplification, status(thm), [f1])).
% 0.55/0.58 fof(f5,negated_conjecture,(((![X]:(![Y]:(~r(X,Y)|r(Y,X))))&(![X]:(![Y]:(![Z]:((~r(X,Y)|~r(Y,Z))|r(X,Z))))))&(?[X]:(?[Y]:(r(X,Y)&~r(X,X))))),inference(fof_nnf, status(thm), [f4])).
% 0.55/0.58 fof(f6,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(?[VAR6]:(?[VAR5]:(r(VAR6,VAR5)&~r(VAR6,VAR6))))),inference(variable_rename, status(thm), [f5])).
% 0.55/0.58 fof(f7,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(r(skf7,skf8)&~r(skf7,skf7))),inference(skolemize, status(esa), [f6])).
% 0.55/0.58 fof(f8,negated_conjecture,(((~r(VAR1,VAR0)|r(VAR0,VAR1))&((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2)))&(r(skf7,skf8)&~r(skf7,skf7))),inference(shift_quantors, status(thm), [f7])).
% 0.55/0.58 cnf(cnf2,negated_conjecture,r(skf7,skf8),inference(split_conjunct, status(thm), [f8])).
% 0.55/0.58 fof(prove_this,conjecture,(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X))))),input).
% 0.55/0.58 fof(f1,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.55/0.58 fof(f4,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(fof_simplification, status(thm), [f1])).
% 0.55/0.58 fof(f5,negated_conjecture,(((![X]:(![Y]:(~r(X,Y)|r(Y,X))))&(![X]:(![Y]:(![Z]:((~r(X,Y)|~r(Y,Z))|r(X,Z))))))&(?[X]:(?[Y]:(r(X,Y)&~r(X,X))))),inference(fof_nnf, status(thm), [f4])).
% 0.55/0.58 fof(f6,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(?[VAR6]:(?[VAR5]:(r(VAR6,VAR5)&~r(VAR6,VAR6))))),inference(variable_rename, status(thm), [f5])).
% 0.55/0.58 fof(f7,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(r(skf7,skf8)&~r(skf7,skf7))),inference(skolemize, status(esa), [f6])).
% 0.55/0.58 fof(f8,negated_conjecture,(((~r(VAR1,VAR0)|r(VAR0,VAR1))&((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2)))&(r(skf7,skf8)&~r(skf7,skf7))),inference(shift_quantors, status(thm), [f7])).
% 0.55/0.58 cnf(cnf0,negated_conjecture,~r(X1,X2)|r(X2,X1),inference(split_conjunct, status(thm), [f8])).
% 0.55/0.58 cnf(c0,plain,r(skf8,skf7),inference(resolution, status(thm), [cnf0, cnf2])).
% 0.55/0.58 fof(prove_this,conjecture,(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X))))),input).
% 0.55/0.58 fof(f1,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(assume_negation, status(cth), [prove_this])).
% 0.55/0.58 fof(f4,negated_conjecture,(~(((![X]:(![Y]:(r(X,Y)=>r(Y,X))))&(![X]:(![Y]:(![Z]:((r(X,Y)&r(Y,Z))=>r(X,Z))))))=>(![X]:(![Y]:(r(X,Y)=>r(X,X)))))),inference(fof_simplification, status(thm), [f1])).
% 0.55/0.58 fof(f5,negated_conjecture,(((![X]:(![Y]:(~r(X,Y)|r(Y,X))))&(![X]:(![Y]:(![Z]:((~r(X,Y)|~r(Y,Z))|r(X,Z))))))&(?[X]:(?[Y]:(r(X,Y)&~r(X,X))))),inference(fof_nnf, status(thm), [f4])).
% 0.55/0.58 fof(f6,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(?[VAR6]:(?[VAR5]:(r(VAR6,VAR5)&~r(VAR6,VAR6))))),inference(variable_rename, status(thm), [f5])).
% 0.55/0.58 fof(f7,negated_conjecture,(((![VAR1]:(![VAR0]:(~r(VAR1,VAR0)|r(VAR0,VAR1))))&(![VAR4]:(![VAR3]:(![VAR2]:((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2))))))&(r(skf7,skf8)&~r(skf7,skf7))),inference(skolemize, status(esa), [f6])).
% 0.55/0.58 fof(f8,negated_conjecture,(((~r(VAR1,VAR0)|r(VAR0,VAR1))&((~r(VAR4,VAR3)|~r(VAR3,VAR2))|r(VAR4,VAR2)))&(r(skf7,skf8)&~r(skf7,skf7))),inference(shift_quantors, status(thm), [f7])).
% 0.55/0.58 cnf(cnf1,negated_conjecture,~r(X3,X4)|~r(X4,X5)|r(X3,X5),inference(split_conjunct, status(thm), [f8])).
% 0.55/0.58 cnf(c3,plain,~r(X7,skf8)|r(X7,skf7),inference(resolution, status(thm), [cnf1, c0])).
% 0.55/0.58 cnf(c5,plain,r(skf7,skf7),inference(resolution, status(thm), [c3, cnf2])).
% 0.55/0.58 cnf(c7,plain,$false,inference(resolution, status(thm), [c5, cnf3])).
% 0.55/0.58 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.58 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.58 # Indexed : true
% 0.55/0.58 # Eval function name : PickGiven5
% 0.55/0.58 # Initial clauses : 4
% 0.55/0.58 # Processed clauses : 7
% 0.55/0.58 # Factors computed : 1
% 0.55/0.58 # Resolvents computed: 8
% 0.55/0.58 # Tautologies deleted: 1
% 0.55/0.58 # Forward subsumed : 1
% 0.55/0.58 # Backward subsumed : 0
% 0.55/0.58 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.58 # SZS Expected : Theorem
% 0.55/0.58 # time : 32ms
% 0.55/0.58
%------------------------------------------------------------------------------