TSTP Solution File: GRP240-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP240-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 : n003.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:36 EDT 2022
% Result : Unsatisfiable 174.67s 22.55s
% Output : CNFRefutation 174.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP240-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/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.33 % Computer : n003.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 : Mon Jun 13 23:56:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 60 Number of unprocessed: 60
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 60 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 57 conjectures.
% 0.12/0.37 # There are 57 start rule candidates:
% 0.12/0.37 # Found 3 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 57 start rule tableaux created.
% 0.12/0.37 # 57 extension rule candidate clauses
% 0.12/0.37 # 3 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 4.47/0.97 # Creating equality axioms
% 4.47/0.97 # Ran out of tableaux, making start rules for all clauses
% 4.47/0.98 # Creating equality axioms
% 4.47/0.98 # Ran out of tableaux, making start rules for all clauses
% 4.98/0.99 # Creating equality axioms
% 4.98/0.99 # Ran out of tableaux, making start rules for all clauses
% 4.98/1.00 # Creating equality axioms
% 4.98/1.00 # Ran out of tableaux, making start rules for all clauses
% 4.98/1.02 # Creating equality axioms
% 4.98/1.02 # Ran out of tableaux, making start rules for all clauses
% 6.31/1.20 # Creating equality axioms
% 6.31/1.20 # Ran out of tableaux, making start rules for all clauses
% 6.31/1.21 # Creating equality axioms
% 6.31/1.21 # Ran out of tableaux, making start rules for all clauses
% 6.84/1.24 # Creating equality axioms
% 6.84/1.24 # Ran out of tableaux, making start rules for all clauses
% 174.67/22.55 # There were 32 total branch saturation attempts.
% 174.67/22.55 # There were 0 of these attempts blocked.
% 174.67/22.55 # There were 0 deferred branch saturation attempts.
% 174.67/22.55 # There were 1 free duplicated saturations.
% 174.67/22.55 # There were 6 total successful branch saturations.
% 174.67/22.55 # There were 0 successful branch saturations in interreduction.
% 174.67/22.55 # There were 0 successful branch saturations on the branch.
% 174.67/22.55 # There were 5 successful branch saturations after the branch.
% 174.67/22.55 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 174.67/22.55 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 174.67/22.55 # Begin clausification derivation
% 174.67/22.55
% 174.67/22.55 # End clausification derivation
% 174.67/22.55 # Begin listing active clauses obtained from FOF to CNF conversion
% 174.67/22.55 cnf(i_0_61, plain, (multiply(identity,X1)=X1)).
% 174.67/22.55 cnf(i_0_62, plain, (multiply(inverse(X1),X1)=identity)).
% 174.67/22.55 cnf(i_0_63, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 174.67/22.55 cnf(i_0_64, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_67, negated_conjecture, (inverse(sk_c5)=sk_c6|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_71, negated_conjecture, (inverse(sk_c7)=sk_c10|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_72, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_75, negated_conjecture, (inverse(sk_c5)=sk_c6|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_79, negated_conjecture, (inverse(sk_c7)=sk_c10|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_88, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c4)=sk_c10)).
% 174.67/22.55 cnf(i_0_112, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c4)=sk_c10)).
% 174.67/22.55 cnf(i_0_91, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c5)=sk_c6)).
% 174.67/22.55 cnf(i_0_115, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c5)=sk_c6)).
% 174.67/22.55 cnf(i_0_95, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c7)=sk_c10)).
% 174.67/22.55 cnf(i_0_119, negated_conjecture, (inverse(sk_c2)=sk_c10|inverse(sk_c7)=sk_c10)).
% 174.67/22.55 cnf(i_0_69, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_65, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_66, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_68, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_70, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_77, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_73, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_74, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_76, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_78, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_96, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c4)=sk_c10)).
% 174.67/22.55 cnf(i_0_80, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c4)=sk_c10)).
% 174.67/22.55 cnf(i_0_104, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c4)=sk_c10)).
% 174.67/22.55 cnf(i_0_99, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c5)=sk_c6)).
% 174.67/22.55 cnf(i_0_83, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c5)=sk_c6)).
% 174.67/22.55 cnf(i_0_107, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c5)=sk_c6)).
% 174.67/22.55 cnf(i_0_103, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|inverse(sk_c7)=sk_c10)).
% 174.67/22.55 cnf(i_0_87, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c7)=sk_c10)).
% 174.67/22.55 cnf(i_0_111, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|inverse(sk_c7)=sk_c10)).
% 174.67/22.55 cnf(i_0_93, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c1)=sk_c9)).
% 174.67/22.55 cnf(i_0_89, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|inverse(sk_c1)=sk_c9)).
% 174.67/22.55 cnf(i_0_90, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|inverse(sk_c1)=sk_c9)).
% 174.67/22.55 cnf(i_0_92, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|inverse(sk_c1)=sk_c9)).
% 174.67/22.55 cnf(i_0_94, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c1)=sk_c9)).
% 174.67/22.55 cnf(i_0_117, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c2)=sk_c10)).
% 174.67/22.55 cnf(i_0_113, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|inverse(sk_c2)=sk_c10)).
% 174.67/22.55 cnf(i_0_114, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|inverse(sk_c2)=sk_c10)).
% 174.67/22.55 cnf(i_0_116, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|inverse(sk_c2)=sk_c10)).
% 174.67/22.55 cnf(i_0_118, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c2)=sk_c10)).
% 174.67/22.55 cnf(i_0_101, negated_conjecture, (multiply(sk_c10,sk_c3)=sk_c9|multiply(sk_c10,sk_c8)=sk_c9)).
% 174.67/22.55 cnf(i_0_85, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|multiply(sk_c10,sk_c8)=sk_c9)).
% 174.67/22.55 cnf(i_0_109, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c10,sk_c8)=sk_c9)).
% 174.67/22.55 cnf(i_0_97, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c10|multiply(sk_c10,sk_c3)=sk_c9)).
% 174.67/22.55 cnf(i_0_98, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c9|multiply(sk_c10,sk_c3)=sk_c9)).
% 174.67/22.55 cnf(i_0_100, negated_conjecture, (multiply(sk_c6,sk_c10)=sk_c9|multiply(sk_c10,sk_c3)=sk_c9)).
% 174.67/22.55 cnf(i_0_102, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|multiply(sk_c10,sk_c3)=sk_c9)).
% 174.67/22.55 cnf(i_0_81, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|multiply(sk_c4,sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_105, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c4,sk_c9)=sk_c10)).
% 174.67/22.55 cnf(i_0_82, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|multiply(sk_c5,sk_c6)=sk_c9)).
% 174.67/22.55 cnf(i_0_106, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c5,sk_c6)=sk_c9)).
% 174.67/22.55 cnf(i_0_84, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|multiply(sk_c6,sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_108, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c6,sk_c10)=sk_c9)).
% 174.67/22.55 cnf(i_0_86, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|multiply(sk_c7,sk_c10)=sk_c8)).
% 174.67/22.55 cnf(i_0_110, negated_conjecture, (multiply(sk_c2,sk_c10)=sk_c3|multiply(sk_c7,sk_c10)=sk_c8)).
% 174.67/22.55 cnf(i_0_120, negated_conjecture, (multiply(sk_c10,multiply(X1,sk_c10))!=sk_c9|multiply(sk_c10,multiply(X2,sk_c10))!=sk_c9|multiply(inverse(X3),sk_c10)!=sk_c9|multiply(X3,inverse(X3))!=sk_c9|multiply(X4,sk_c9)!=sk_c10|multiply(X5,sk_c9)!=sk_c10|inverse(sk_c10)!=sk_c9|inverse(sk_c9)!=sk_c10|inverse(X1)!=sk_c10|inverse(X4)!=sk_c10|inverse(X2)!=sk_c10|inverse(X5)!=sk_c9)).
% 174.67/22.55 cnf(i_0_1500, plain, (X9=X9)).
% 174.67/22.55 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 174.67/22.55 # Begin printing tableau
% 174.67/22.55 # Found 7 steps
% 174.67/22.55 cnf(i_0_1500, plain, (X6=X6), inference(start_rule)).
% 174.67/22.55 cnf(i_0_1633, plain, (X6=X6), inference(extension_rule, [i_0_1505])).
% 174.67/22.55 cnf(i_0_1983946, plain, (inverse(X6)=inverse(X6)), inference(extension_rule, [i_0_1503])).
% 174.67/22.55 cnf(i_0_1984078, plain, (multiply(identity,inverse(X6))!=inverse(X6)), inference(closure_rule, [i_0_61])).
% 174.67/22.55 cnf(i_0_1984076, plain, (inverse(X6)=multiply(identity,inverse(X6))), inference(extension_rule, [i_0_1504])).
% 174.67/22.55 cnf(i_0_2059724, plain, (multiply(identity,X1)!=X1), inference(closure_rule, [i_0_61])).
% 174.67/22.55 cnf(i_0_2059722, plain, (multiply(inverse(X6),multiply(identity,X1))=multiply(multiply(identity,inverse(X6)),X1)), inference(etableau_closure_rule, [i_0_2059722, ...])).
% 174.67/22.55 # End printing tableau
% 174.67/22.55 # SZS output end
% 174.67/22.55 # Branches closed with saturation will be marked with an "s"
% 174.67/22.56 # Child (19067) has found a proof.
% 174.67/22.56
% 174.67/22.56 # Proof search is over...
% 174.67/22.56 # Freeing feature tree
%------------------------------------------------------------------------------