0.00/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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.31	% Computer   : n013.cluster.edu
0.12/0.31	% Model      : x86_64 x86_64
0.12/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.31	% Memory     : 8042.1875MB
0.12/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.31	% CPULimit   : 1200
0.12/0.31	% WCLimit    : 120
0.12/0.31	% DateTime   : Tue Jul 13 16:52:03 EDT 2021
0.12/0.31	% CPUTime    : 
0.17/0.45	# Using default include path : /export/starexec/sandbox2/benchmark
0.17/0.45	# INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
0.17/0.45	# ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
0.17/0.45	# 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.17/0.45	# ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
0.17/0.47	# INFO in Formula.command2clauses(): include file: /export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax
0.91/0.67	# hasConjecture: true isFOF: true
0.91/0.67	# ProverFOF() problem is equational
0.91/0.67	# INFO in ClauseSet.addEqAxioms(): adding axioms
1.15/0.68	# ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
1.15/0.69	# HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
140.25/120.18	Alarm clock
140.25/120.18	EOF