TSTP Solution File: GRP292-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP292-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 : n019.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:49 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP292-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n019.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 : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 10:41:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.38 #
% 0.13/0.38 # Presaturation interreduction done
% 0.13/0.38 # Number of axioms: 24 Number of unprocessed: 24
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 24 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 21 conjectures.
% 0.13/0.38 # There are 21 start rule candidates:
% 0.13/0.38 # Found 3 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 21 start rule tableaux created.
% 0.13/0.38 # 21 extension rule candidate clauses
% 0.13/0.38 # 3 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.40 # Creating equality axioms
% 0.13/0.40 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.40 # There were 1 total branch saturation attempts.
% 0.13/0.40 # There were 0 of these attempts blocked.
% 0.13/0.40 # There were 0 deferred branch saturation attempts.
% 0.13/0.40 # There were 0 free duplicated saturations.
% 0.13/0.40 # There were 1 total successful branch saturations.
% 0.13/0.40 # There were 0 successful branch saturations in interreduction.
% 0.13/0.40 # There were 0 successful branch saturations on the branch.
% 0.13/0.40 # There were 1 successful branch saturations after the branch.
% 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40 # Begin clausification derivation
% 0.13/0.40
% 0.13/0.40 # End clausification derivation
% 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.40 cnf(i_0_25, plain, (multiply(identity,X1)=X1)).
% 0.13/0.40 cnf(i_0_26, plain, (multiply(inverse(X1),X1)=identity)).
% 0.13/0.40 cnf(i_0_27, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.13/0.40 cnf(i_0_38, negated_conjecture, (inverse(sk_c1)=sk_c7|inverse(sk_c3)=sk_c4)).
% 0.13/0.40 cnf(i_0_46, negated_conjecture, (inverse(sk_c2)=sk_c5|inverse(sk_c3)=sk_c4)).
% 0.13/0.40 cnf(i_0_30, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c5|inverse(sk_c3)=sk_c4)).
% 0.13/0.40 cnf(i_0_34, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|inverse(sk_c3)=sk_c4)).
% 0.13/0.40 cnf(i_0_42, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|inverse(sk_c3)=sk_c4)).
% 0.13/0.40 cnf(i_0_36, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c7|inverse(sk_c1)=sk_c7)).
% 0.13/0.40 cnf(i_0_37, negated_conjecture, (multiply(sk_c3,sk_c4)=sk_c6|inverse(sk_c1)=sk_c7)).
% 0.13/0.40 cnf(i_0_39, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|inverse(sk_c1)=sk_c7)).
% 0.13/0.40 cnf(i_0_44, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c7|inverse(sk_c2)=sk_c5)).
% 0.13/0.40 cnf(i_0_45, negated_conjecture, (multiply(sk_c3,sk_c4)=sk_c6|inverse(sk_c2)=sk_c5)).
% 0.13/0.40 cnf(i_0_47, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|inverse(sk_c2)=sk_c5)).
% 0.13/0.40 cnf(i_0_28, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c7|multiply(sk_c7,sk_c6)=sk_c5)).
% 0.13/0.40 cnf(i_0_29, negated_conjecture, (multiply(sk_c3,sk_c4)=sk_c6|multiply(sk_c7,sk_c6)=sk_c5)).
% 0.13/0.40 cnf(i_0_31, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|multiply(sk_c7,sk_c6)=sk_c5)).
% 0.13/0.40 cnf(i_0_32, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|multiply(sk_c5,sk_c6)=sk_c7)).
% 0.13/0.40 cnf(i_0_40, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c5,sk_c6)=sk_c7)).
% 0.13/0.40 cnf(i_0_33, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|multiply(sk_c3,sk_c4)=sk_c6)).
% 0.13/0.40 cnf(i_0_41, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c3,sk_c4)=sk_c6)).
% 0.13/0.40 cnf(i_0_35, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|multiply(sk_c4,sk_c5)=sk_c6)).
% 0.13/0.40 cnf(i_0_43, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c4,sk_c5)=sk_c6)).
% 0.13/0.40 cnf(i_0_48, negated_conjecture, (multiply(inverse(X1),sk_c5)!=sk_c6|multiply(sk_c7,sk_c6)!=sk_c5|multiply(sk_c5,sk_c6)!=sk_c7|multiply(X1,inverse(X1))!=sk_c6|multiply(X2,sk_c5)!=sk_c6|multiply(X3,sk_c7)!=sk_c6|inverse(X2)!=sk_c5|inverse(X3)!=sk_c7)).
% 0.13/0.40 cnf(i_0_490, plain, (X5=X5)).
% 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.40 # Begin printing tableau
% 0.13/0.40 # Found 6 steps
% 0.13/0.40 cnf(i_0_490, plain, (identity=identity), inference(start_rule)).
% 0.13/0.40 cnf(i_0_547, plain, (identity=identity), inference(extension_rule, [i_0_494])).
% 0.13/0.40 cnf(i_0_605, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_25])).
% 0.13/0.40 cnf(i_0_603, plain, (multiply(identity,multiply(identity,identity))=multiply(identity,identity)), inference(extension_rule, [i_0_493])).
% 0.13/0.40 cnf(i_0_660, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_25])).
% 0.13/0.40 cnf(i_0_658, plain, (multiply(identity,multiply(identity,identity))=identity), inference(etableau_closure_rule, [i_0_658, ...])).
% 0.13/0.40 # End printing tableau
% 0.13/0.40 # SZS output end
% 0.13/0.40 # Branches closed with saturation will be marked with an "s"
% 0.13/0.40 # Child (6904) has found a proof.
% 0.13/0.40
% 0.13/0.40 # Proof search is over...
% 0.13/0.40 # Freeing feature tree
%------------------------------------------------------------------------------