TSTP Solution File: GRP175-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP175-3 : 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 : n032.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 : Sat Jul 16 09:05:14 EDT 2022
% Result : Unsatisfiable 0.14s 0.33s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.28 % DateTime : Tue Jun 14 05:48:57 EDT 2022
% 0.10/0.28 % CPUTime :
% 0.14/0.31 # No SInE strategy applied
% 0.14/0.31 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.14/0.31 # and selection function SelectNewComplexAHP.
% 0.14/0.31 #
% 0.14/0.31 # Presaturation interreduction done
% 0.14/0.31 # Number of axioms: 17 Number of unprocessed: 17
% 0.14/0.31 # Tableaux proof search.
% 0.14/0.31 # APR header successfully linked.
% 0.14/0.31 # Hello from C++
% 0.14/0.31 # The folding up rule is enabled...
% 0.14/0.31 # Local unification is enabled...
% 0.14/0.31 # Any saturation attempts will use folding labels...
% 0.14/0.31 # 17 beginning clauses after preprocessing and clausification
% 0.14/0.31 # Creating start rules for all 1 conjectures.
% 0.14/0.31 # There are 1 start rule candidates:
% 0.14/0.31 # Found 17 unit axioms.
% 0.14/0.31 # 1 start rule tableaux created.
% 0.14/0.31 # 0 extension rule candidate clauses
% 0.14/0.31 # 17 unit axiom clauses
% 0.14/0.31
% 0.14/0.31 # Requested 8, 32 cores available to the main process.
% 0.14/0.31 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.31 # Creating equality axioms
% 0.14/0.31 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.31 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.31 # We now have 26 tableaux to operate on
% 0.14/0.33 # There were 1 total branch saturation attempts.
% 0.14/0.33 # There were 0 of these attempts blocked.
% 0.14/0.33 # There were 0 deferred branch saturation attempts.
% 0.14/0.33 # There were 0 free duplicated saturations.
% 0.14/0.33 # There were 1 total successful branch saturations.
% 0.14/0.33 # There were 0 successful branch saturations in interreduction.
% 0.14/0.33 # There were 0 successful branch saturations on the branch.
% 0.14/0.33 # There were 1 successful branch saturations after the branch.
% 0.14/0.33 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.33 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.33 # Begin clausification derivation
% 0.14/0.33
% 0.14/0.33 # End clausification derivation
% 0.14/0.33 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.33 cnf(i_0_33, hypothesis, (least_upper_bound(identity,b)=b)).
% 0.14/0.33 cnf(i_0_18, plain, (multiply(identity,X1)=X1)).
% 0.14/0.33 cnf(i_0_26, plain, (greatest_lower_bound(X1,X1)=X1)).
% 0.14/0.33 cnf(i_0_25, plain, (least_upper_bound(X1,X1)=X1)).
% 0.14/0.33 cnf(i_0_19, plain, (multiply(inverse(X1),X1)=identity)).
% 0.14/0.33 cnf(i_0_28, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
% 0.14/0.33 cnf(i_0_27, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
% 0.14/0.33 cnf(i_0_23, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
% 0.14/0.33 cnf(i_0_24, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
% 0.14/0.33 cnf(i_0_20, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.14/0.33 cnf(i_0_30, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
% 0.14/0.33 cnf(i_0_29, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
% 0.14/0.33 cnf(i_0_32, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
% 0.14/0.33 cnf(i_0_31, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
% 0.14/0.33 cnf(i_0_21, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
% 0.14/0.33 cnf(i_0_22, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
% 0.14/0.33 cnf(i_0_34, negated_conjecture, (greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a)))!=identity)).
% 0.14/0.33 cnf(i_0_36, plain, (X4=X4)).
% 0.14/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.33 # Begin printing tableau
% 0.14/0.33 # Found 6 steps
% 0.14/0.33 cnf(i_0_33, hypothesis, (least_upper_bound(identity,b)=b), inference(start_rule)).
% 0.14/0.33 cnf(i_0_44, plain, (least_upper_bound(identity,b)=b), inference(extension_rule, [i_0_43])).
% 0.14/0.33 cnf(i_0_79, plain, (least_upper_bound(identity,b)!=b), inference(closure_rule, [i_0_33])).
% 0.14/0.33 cnf(i_0_77, plain, (least_upper_bound(least_upper_bound(identity,b),least_upper_bound(identity,b))=least_upper_bound(b,b)), inference(extension_rule, [i_0_39])).
% 0.14/0.33 cnf(i_0_86, plain, (least_upper_bound(b,b)!=multiply(identity,least_upper_bound(b,b))), inference(closure_rule, [i_0_18])).
% 0.14/0.33 cnf(i_0_84, plain, (least_upper_bound(least_upper_bound(identity,b),least_upper_bound(identity,b))=multiply(identity,least_upper_bound(b,b))), inference(etableau_closure_rule, [i_0_84, ...])).
% 0.14/0.33 # End printing tableau
% 0.14/0.33 # SZS output end
% 0.14/0.33 # Branches closed with saturation will be marked with an "s"
% 0.14/0.33 # Child (14682) has found a proof.
% 0.14/0.33
% 0.14/0.33 # Proof search is over...
% 0.14/0.33 # Freeing feature tree
%------------------------------------------------------------------------------