TSTP Solution File: BOO014-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : BOO014-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.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 : Thu Jul 14 23:38:26 EDT 2022
% Result : Unsatisfiable 12.10s 1.91s
% Output : CNFRefutation 12.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : BOO014-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 1 23:19:27 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.40 # No SInE strategy applied
% 0.12/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.12/0.40 # and selection function SelectCQIPrecWNTNp.
% 0.12/0.40 #
% 0.12/0.40 # Presaturation interreduction done
% 0.12/0.40 # Number of axioms: 25 Number of unprocessed: 25
% 0.12/0.40 # Tableaux proof search.
% 0.12/0.40 # APR header successfully linked.
% 0.12/0.40 # Hello from C++
% 0.12/0.41 # The folding up rule is enabled...
% 0.12/0.41 # Local unification is enabled...
% 0.12/0.41 # Any saturation attempts will use folding labels...
% 0.12/0.41 # 25 beginning clauses after preprocessing and clausification
% 0.12/0.41 # Creating start rules for all 3 conjectures.
% 0.12/0.41 # There are 3 start rule candidates:
% 0.12/0.41 # Found 13 unit axioms.
% 0.12/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.41 # 3 start rule tableaux created.
% 0.12/0.41 # 12 extension rule candidate clauses
% 0.12/0.41 # 13 unit axiom clauses
% 0.12/0.41
% 0.12/0.41 # Requested 8, 32 cores available to the main process.
% 0.12/0.41 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.41 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.41 # We now have 22 tableaux to operate on
% 12.10/1.91 # There were 2 total branch saturation attempts.
% 12.10/1.91 # There were 0 of these attempts blocked.
% 12.10/1.91 # There were 0 deferred branch saturation attempts.
% 12.10/1.91 # There were 0 free duplicated saturations.
% 12.10/1.91 # There were 1 total successful branch saturations.
% 12.10/1.91 # There were 0 successful branch saturations in interreduction.
% 12.10/1.91 # There were 0 successful branch saturations on the branch.
% 12.10/1.91 # There were 1 successful branch saturations after the branch.
% 12.10/1.91 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.10/1.91 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.10/1.91 # Begin clausification derivation
% 12.10/1.91
% 12.10/1.91 # End clausification derivation
% 12.10/1.91 # Begin listing active clauses obtained from FOF to CNF conversion
% 12.10/1.91 cnf(i_0_48, negated_conjecture, (sum(x,y,x_plus_y))).
% 12.10/1.91 cnf(i_0_49, negated_conjecture, (product(inverse(x),inverse(y),x_inverse_times_y_inverse))).
% 12.10/1.91 cnf(i_0_31, plain, (sum(X1,additive_identity,X1))).
% 12.10/1.91 cnf(i_0_33, plain, (product(X1,multiplicative_identity,X1))).
% 12.10/1.91 cnf(i_0_30, plain, (sum(additive_identity,X1,X1))).
% 12.10/1.91 cnf(i_0_32, plain, (product(multiplicative_identity,X1,X1))).
% 12.10/1.91 cnf(i_0_43, plain, (sum(X1,inverse(X1),multiplicative_identity))).
% 12.10/1.91 cnf(i_0_45, plain, (product(X1,inverse(X1),additive_identity))).
% 12.10/1.91 cnf(i_0_42, plain, (sum(inverse(X1),X1,multiplicative_identity))).
% 12.10/1.91 cnf(i_0_44, plain, (product(inverse(X1),X1,additive_identity))).
% 12.10/1.91 cnf(i_0_26, plain, (sum(X1,X2,add(X1,X2)))).
% 12.10/1.91 cnf(i_0_27, plain, (product(X1,X2,multiply(X1,X2)))).
% 12.10/1.91 cnf(i_0_50, negated_conjecture, (inverse(x_plus_y)!=x_inverse_times_y_inverse)).
% 12.10/1.91 cnf(i_0_28, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 12.10/1.91 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X2,X1,X3))).
% 12.10/1.91 cnf(i_0_46, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))).
% 12.10/1.91 cnf(i_0_47, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 12.10/1.91 cnf(i_0_41, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X1)|~sum(X7,X2,X5)|~sum(X6,X2,X4))).
% 12.10/1.91 cnf(i_0_34, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))).
% 12.10/1.91 cnf(i_0_36, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))).
% 12.10/1.91 cnf(i_0_39, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X2)|~sum(X1,X7,X5)|~sum(X1,X6,X4))).
% 12.10/1.91 cnf(i_0_37, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))).
% 12.10/1.91 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X6,X7,X3)|~sum(X5,X7,X2)|~sum(X4,X7,X1))).
% 12.10/1.91 cnf(i_0_38, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X7,X6,X3)|~sum(X7,X5,X2)|~sum(X7,X4,X1))).
% 12.10/1.91 cnf(i_0_35, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))).
% 12.10/1.91 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 12.10/1.91 # Begin printing tableau
% 12.10/1.91 # Found 9 steps
% 12.10/1.91 cnf(i_0_49, negated_conjecture, (product(inverse(x),inverse(y),x_inverse_times_y_inverse)), inference(start_rule)).
% 12.10/1.91 cnf(i_0_52, plain, (product(inverse(x),inverse(y),x_inverse_times_y_inverse)), inference(extension_rule, [i_0_38])).
% 12.10/1.91 cnf(i_0_146, plain, (~sum(additive_identity,x_inverse_times_y_inverse,x_inverse_times_y_inverse)), inference(closure_rule, [i_0_30])).
% 12.10/1.91 cnf(i_0_147, plain, (~sum(additive_identity,inverse(y),inverse(y))), inference(closure_rule, [i_0_30])).
% 12.10/1.91 cnf(i_0_144, plain, (product(inverse(x),inverse(y),x_inverse_times_y_inverse)), inference(extension_rule, [i_0_29])).
% 12.10/1.91 cnf(i_0_148, plain, (~sum(additive_identity,inverse(x),inverse(x))), inference(closure_rule, [i_0_30])).
% 12.10/1.91 cnf(i_0_156, plain, (product(inverse(y),inverse(x),x_inverse_times_y_inverse)), inference(extension_rule, [i_0_47])).
% 12.10/1.91 cnf(i_0_37129, plain, (inverse(x_plus_y)=x_inverse_times_y_inverse), inference(closure_rule, [i_0_50])).
% 12.10/1.91 cnf(i_0_37131, plain, (~product(inverse(y),inverse(x),inverse(x_plus_y))), inference(etableau_closure_rule, [i_0_37131, ...])).
% 12.10/1.91 # End printing tableau
% 12.10/1.91 # SZS output end
% 12.10/1.91 # Branches closed with saturation will be marked with an "s"
% 12.10/1.92 # Child (9407) has found a proof.
% 12.10/1.92
% 12.10/1.92 # Proof search is over...
% 12.10/1.92 # Freeing feature tree
%------------------------------------------------------------------------------