0.12/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_epr.jar %d %s 0.13/0.35 % Computer : n004.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Thu Jul 2 06:57:43 EDT 2020 0.13/0.35 % CPUTime : 0.21/0.46 openjdk version "1.8.0_171" 0.21/0.46 OpenJDK Runtime Environment (build 1.8.0_171-b10) 0.21/0.46 OpenJDK 64-Bit Server VM (build 25.171-b10, mixed mode) 0.21/0.46 file=/export/starexec/sandbox/benchmark/theBenchmark.p 0.46/0.62 start to proof:theBenchmark.p 0.69/0.74 % Version : CSE_E---1.2 0.69/0.74 % Problem : theBenchmark.p 0.69/0.74 % Proof found! 0.69/0.74 % SZS status Theorem for theBenchmark.p 0.69/0.74 % SZS output start Proof 0.69/0.74 fof(ax83, axiom, ![X40, X41]:X41=constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X40,X41)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax83)). 0.69/0.74 fof(ax82, axiom, ![X82, X83, X84]:tuple_assoc_pair(X82,tuple_assoc_pair(X83,X84))=tuple_assoc_pair(tuple_assoc_pair(X82,X83),X84), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax82)). 0.69/0.74 fof(co0, conjecture, pred_attacker(name_objective), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co0)). 0.69/0.74 fof(ax143, axiom, ![X34, X35]:(pred_attacker(tuple_assoc_pair(X34,X35))=>pred_attacker(X34)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax143)). 0.69/0.74 fof(ax147, axiom, pred_attacker(constr_CONST_4), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax147)). 0.69/0.74 fof(c_0_5, plain, ![X170, X171]:X171=constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X170,X171)), inference(variable_rename,[status(thm)],[ax83])). 0.69/0.74 fof(c_0_6, plain, ![X212, X213, X214]:tuple_assoc_pair(X212,tuple_assoc_pair(X213,X214))=tuple_assoc_pair(tuple_assoc_pair(X212,X213),X214), inference(variable_rename,[status(thm)],[ax82])). 0.69/0.74 fof(c_0_7, negated_conjecture, ~(pred_attacker(name_objective)), inference(assume_negation,[status(cth)],[co0])). 0.69/0.74 fof(c_0_8, plain, ![X164, X165]:(~pred_attacker(tuple_assoc_pair(X164,X165))|pred_attacker(X164)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax143])])). 0.69/0.74 cnf(c_0_9, plain, (X1=constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.69/0.74 cnf(c_0_10, plain, (tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3))=tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.69/0.74 fof(c_0_11, negated_conjecture, ~pred_attacker(name_objective), inference(fof_simplification,[status(thm)],[c_0_7])). 0.69/0.74 cnf(c_0_12, plain, (pred_attacker(X1)|~pred_attacker(tuple_assoc_pair(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.69/0.74 cnf(c_0_13, plain, (tuple_assoc_pair(X1,X2)=X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_9])). 0.69/0.74 cnf(c_0_14, negated_conjecture, (~pred_attacker(name_objective)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.69/0.74 cnf(c_0_15, plain, (pred_attacker(X1)|~pred_attacker(X2)), inference(rw,[status(thm)],[c_0_12, c_0_13])). 0.69/0.74 cnf(c_0_16, plain, (pred_attacker(constr_CONST_4)), inference(split_conjunct,[status(thm)],[ax147])). 0.69/0.74 cnf(c_0_17, negated_conjecture, (~pred_attacker(X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.69/0.74 cnf(c_0_18, plain, ($false), inference(sr,[status(thm)],[c_0_16, c_0_17]), ['proof']). 0.69/0.74 % SZS output end Proof 0.69/0.74 % User time : 0.034 s 0.69/0.74 % System time : 0.007 s 0.69/0.74 % Total time : 0.041 s 0.69/0.74 0.69/0.75 EOF