0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/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.12/0.33	% Computer   : n008.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 16:37:59 EDT 2021
0.12/0.33	% CPUTime    : 
0.18/0.46	# Using default include path : /export/starexec/sandbox/benchmark
0.18/0.46	# INFO in ProverFOF.main(): Processing file /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/0.46	# ProverFOF.processTestFile(): filename: /export/starexec/sandbox/benchmark/theBenchmark.p
0.18/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.18/0.46	# ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
4.35/1.47	# hasConjecture: true isFOF: true
4.35/1.47	# ProverFOF() problem is equational
4.35/1.47	# INFO in ClauseSet.addEqAxioms(): adding axioms
4.35/1.50	# ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
4.35/1.50	# HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
167.29/120.13	Alarm clock
167.29/120.13	EOF