TSTP Solution File: GRP253-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP253-1 : TPTP v8.1.0. Released v2.5.0.
% 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 : n011.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:39 EDT 2022
% Result : Unsatisfiable 0.18s 0.39s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP253-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n011.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 02:30:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 22 Number of unprocessed: 22
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 22 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 19 conjectures.
% 0.18/0.36 # There are 19 start rule candidates:
% 0.18/0.36 # Found 3 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 19 start rule tableaux created.
% 0.18/0.36 # 19 extension rule candidate clauses
% 0.18/0.36 # 3 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.39 # There were 8 total branch saturation attempts.
% 0.18/0.39 # There were 0 of these attempts blocked.
% 0.18/0.39 # There were 0 deferred branch saturation attempts.
% 0.18/0.39 # There were 1 free duplicated saturations.
% 0.18/0.39 # There were 8 total successful branch saturations.
% 0.18/0.39 # There were 0 successful branch saturations in interreduction.
% 0.18/0.39 # There were 0 successful branch saturations on the branch.
% 0.18/0.39 # There were 7 successful branch saturations after the branch.
% 0.18/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.39 # Begin clausification derivation
% 0.18/0.39
% 0.18/0.39 # End clausification derivation
% 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.39 cnf(i_0_23, plain, (multiply(identity,X1)=X1)).
% 0.18/0.39 cnf(i_0_24, plain, (multiply(inverse(X1),X1)=identity)).
% 0.18/0.39 cnf(i_0_25, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.18/0.39 cnf(i_0_30, negated_conjecture, (inverse(sk_c4)=sk_c7|inverse(sk_c1)=sk_c7)).
% 0.18/0.39 cnf(i_0_31, negated_conjecture, (inverse(sk_c5)=sk_c6|inverse(sk_c1)=sk_c7)).
% 0.18/0.39 cnf(i_0_36, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c4)=sk_c7)).
% 0.18/0.39 cnf(i_0_39, negated_conjecture, (inverse(sk_c3)=sk_c6|inverse(sk_c4)=sk_c7)).
% 0.18/0.39 cnf(i_0_37, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c5)=sk_c6)).
% 0.18/0.39 cnf(i_0_40, negated_conjecture, (inverse(sk_c3)=sk_c6|inverse(sk_c5)=sk_c6)).
% 0.18/0.39 cnf(i_0_29, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c6|inverse(sk_c1)=sk_c7)).
% 0.18/0.39 cnf(i_0_27, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|inverse(sk_c4)=sk_c7)).
% 0.18/0.39 cnf(i_0_33, negated_conjecture, (multiply(sk_c2,sk_c6)=sk_c5|inverse(sk_c4)=sk_c7)).
% 0.18/0.39 cnf(i_0_42, negated_conjecture, (multiply(sk_c3,sk_c5)=sk_c6|inverse(sk_c4)=sk_c7)).
% 0.18/0.39 cnf(i_0_28, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|inverse(sk_c5)=sk_c6)).
% 0.18/0.39 cnf(i_0_34, negated_conjecture, (multiply(sk_c2,sk_c6)=sk_c5|inverse(sk_c5)=sk_c6)).
% 0.18/0.39 cnf(i_0_43, negated_conjecture, (multiply(sk_c3,sk_c5)=sk_c6|inverse(sk_c5)=sk_c6)).
% 0.18/0.39 cnf(i_0_35, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c6|inverse(sk_c2)=sk_c6)).
% 0.18/0.39 cnf(i_0_38, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c6|inverse(sk_c3)=sk_c6)).
% 0.18/0.39 cnf(i_0_26, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c6|multiply(sk_c1,sk_c7)=sk_c6)).
% 0.18/0.39 cnf(i_0_32, negated_conjecture, (multiply(sk_c2,sk_c6)=sk_c5|multiply(sk_c4,sk_c7)=sk_c6)).
% 0.18/0.39 cnf(i_0_41, negated_conjecture, (multiply(sk_c3,sk_c5)=sk_c6|multiply(sk_c4,sk_c7)=sk_c6)).
% 0.18/0.39 cnf(i_0_44, negated_conjecture, (multiply(X1,sk_c7)!=sk_c6|multiply(X2,sk_c5)!=sk_c6|multiply(X3,sk_c6)!=sk_c5|multiply(X4,sk_c7)!=sk_c6|inverse(sk_c5)!=sk_c6|inverse(X1)!=sk_c7|inverse(X2)!=sk_c6|inverse(X3)!=sk_c6|inverse(X4)!=sk_c7)).
% 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.39 # Begin printing tableau
% 0.18/0.39 # Found 13 steps
% 0.18/0.39 cnf(i_0_26, negated_conjecture, (multiply(sk_c4,sk_c7)=sk_c6|multiply(sk_c1,sk_c7)=sk_c6), inference(start_rule)).
% 0.18/0.39 cnf(i_0_59, plain, (multiply(sk_c1,sk_c7)=sk_c6), inference(extension_rule, [i_0_44])).
% 0.18/0.39 cnf(i_0_228, plain, (multiply(sk_c1,sk_c7)!=sk_c6), inference(closure_rule, [i_0_59])).
% 0.18/0.39 cnf(i_0_226, plain, (multiply(sk_c3,sk_c5)!=sk_c6), inference(extension_rule, [i_0_41])).
% 0.18/0.39 cnf(i_0_58, plain, (multiply(sk_c4,sk_c7)=sk_c6), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.18/0.39 cnf(i_0_229, plain, (inverse(sk_c5)!=sk_c6), inference(etableau_closure_rule, [i_0_229, ...])).
% 0.18/0.39 cnf(i_0_230, plain, (inverse(sk_c1)!=sk_c7), inference(etableau_closure_rule, [i_0_230, ...])).
% 0.18/0.39 cnf(i_0_231, plain, (inverse(sk_c3)!=sk_c6), inference(etableau_closure_rule, [i_0_231, ...])).
% 0.18/0.39 cnf(i_0_233, plain, (inverse(sk_c1)!=sk_c7), inference(etableau_closure_rule, [i_0_233, ...])).
% 0.18/0.39 cnf(i_0_235, plain, (multiply(sk_c4,sk_c7)=sk_c6), inference(etableau_closure_rule, [i_0_235, ...])).
% 0.18/0.39 cnf(i_0_227, plain, (multiply(sk_c2,sk_c6)!=sk_c5), inference(extension_rule, [i_0_32])).
% 0.18/0.39 cnf(i_0_232, plain, (inverse(sk_c2)!=sk_c6), inference(etableau_closure_rule, [i_0_232, ...])).
% 0.18/0.39 cnf(i_0_1018, plain, (multiply(sk_c4,sk_c7)=sk_c6), inference(etableau_closure_rule, [i_0_1018, ...])).
% 0.18/0.39 # End printing tableau
% 0.18/0.39 # SZS output end
% 0.18/0.39 # Branches closed with saturation will be marked with an "s"
% 0.18/0.39 # Child (30357) has found a proof.
% 0.18/0.39
% 0.18/0.39 # Proof search is over...
% 0.18/0.39 # Freeing feature tree
%------------------------------------------------------------------------------