TSTP Solution File: GRP221-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP221-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 : n017.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:31 EDT 2022
% Result : Unsatisfiable 40.62s 5.49s
% Output : CNFRefutation 40.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP221-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/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 : n017.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 : Tue Jun 14 00:36:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.37 # No SInE strategy applied
% 0.21/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.37 #
% 0.21/0.37 # Presaturation interreduction done
% 0.21/0.37 # Number of axioms: 52 Number of unprocessed: 52
% 0.21/0.37 # Tableaux proof search.
% 0.21/0.37 # APR header successfully linked.
% 0.21/0.37 # Hello from C++
% 0.21/0.37 # The folding up rule is enabled...
% 0.21/0.37 # Local unification is enabled...
% 0.21/0.37 # Any saturation attempts will use folding labels...
% 0.21/0.37 # 52 beginning clauses after preprocessing and clausification
% 0.21/0.37 # Creating start rules for all 49 conjectures.
% 0.21/0.37 # There are 49 start rule candidates:
% 0.21/0.37 # Found 3 unit axioms.
% 0.21/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.37 # 49 start rule tableaux created.
% 0.21/0.37 # 49 extension rule candidate clauses
% 0.21/0.37 # 3 unit axiom clauses
% 0.21/0.37
% 0.21/0.37 # Requested 8, 32 cores available to the main process.
% 3.73/0.85 # Creating equality axioms
% 3.73/0.85 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.88 # Creating equality axioms
% 3.95/0.88 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.89 # Creating equality axioms
% 3.95/0.89 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.90 # Creating equality axioms
% 3.95/0.90 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.91 # Creating equality axioms
% 3.95/0.91 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.91 # Creating equality axioms
% 3.95/0.91 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.91 # Creating equality axioms
% 3.95/0.91 # Ran out of tableaux, making start rules for all clauses
% 3.95/0.91 # Creating equality axioms
% 3.95/0.91 # Ran out of tableaux, making start rules for all clauses
% 40.62/5.49 # There were 13 total branch saturation attempts.
% 40.62/5.49 # There were 0 of these attempts blocked.
% 40.62/5.49 # There were 0 deferred branch saturation attempts.
% 40.62/5.49 # There were 1 free duplicated saturations.
% 40.62/5.49 # There were 5 total successful branch saturations.
% 40.62/5.49 # There were 0 successful branch saturations in interreduction.
% 40.62/5.49 # There were 0 successful branch saturations on the branch.
% 40.62/5.49 # There were 4 successful branch saturations after the branch.
% 40.62/5.49 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 40.62/5.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 40.62/5.49 # Begin clausification derivation
% 40.62/5.49
% 40.62/5.49 # End clausification derivation
% 40.62/5.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 40.62/5.49 cnf(i_0_53, plain, (multiply(identity,X1)=X1)).
% 40.62/5.49 cnf(i_0_54, plain, (multiply(inverse(X1),X1)=identity)).
% 40.62/5.49 cnf(i_0_55, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 40.62/5.49 cnf(i_0_56, negated_conjecture, (inverse(sk_c10)=sk_c9|inverse(sk_c1)=sk_c10)).
% 40.62/5.49 cnf(i_0_57, negated_conjecture, (inverse(sk_c6)=sk_c10|inverse(sk_c1)=sk_c10)).
% 40.62/5.49 cnf(i_0_61, negated_conjecture, (inverse(sk_c7)=sk_c10|inverse(sk_c1)=sk_c10)).
% 40.62/5.49 cnf(i_0_74, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_98, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_75, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_99, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_79, negated_conjecture, (inverse(sk_c2)=sk_c3|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_103, negated_conjecture, (inverse(sk_c4)=sk_c10|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_59, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c1)=sk_c10)).
% 40.62/5.49 cnf(i_0_58, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c10|inverse(sk_c1)=sk_c10)).
% 40.62/5.49 cnf(i_0_60, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c1)=sk_c10)).
% 40.62/5.49 cnf(i_0_62, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_86, negated_conjecture, (multiply(sk_c10,sk_c5)=sk_c9|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_68, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c9|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_80, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c9|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_92, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c5|inverse(sk_c10)=sk_c9)).
% 40.62/5.49 cnf(i_0_63, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_87, negated_conjecture, (multiply(sk_c10,sk_c5)=sk_c9|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_69, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c9|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_81, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c9|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_93, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c5|inverse(sk_c6)=sk_c10)).
% 40.62/5.49 cnf(i_0_67, negated_conjecture, (multiply(sk_c1,sk_c9)=sk_c10|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_91, negated_conjecture, (multiply(sk_c10,sk_c5)=sk_c9|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_73, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c9|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_85, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c9|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_97, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c5|inverse(sk_c7)=sk_c10)).
% 40.62/5.49 cnf(i_0_77, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c2)=sk_c3)).
% 40.62/5.49 cnf(i_0_76, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c10|inverse(sk_c2)=sk_c3)).
% 40.62/5.49 cnf(i_0_78, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c2)=sk_c3)).
% 40.62/5.49 cnf(i_0_101, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|inverse(sk_c4)=sk_c10)).
% 40.62/5.49 cnf(i_0_100, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c10|inverse(sk_c4)=sk_c10)).
% 40.62/5.49 cnf(i_0_102, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|inverse(sk_c4)=sk_c10)).
% 40.62/5.49 cnf(i_0_65, negated_conjecture, (multiply(sk_c10,sk_c8)=sk_c9|multiply(sk_c1,sk_c9)=sk_c10)).
% 40.62/5.49 cnf(i_0_64, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c10|multiply(sk_c1,sk_c9)=sk_c10)).
% 40.62/5.49 cnf(i_0_66, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|multiply(sk_c1,sk_c9)=sk_c10)).
% 40.62/5.49 cnf(i_0_89, negated_conjecture, (multiply(sk_c10,sk_c5)=sk_c9|multiply(sk_c10,sk_c8)=sk_c9)).
% 40.62/5.49 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c9|multiply(sk_c10,sk_c8)=sk_c9)).
% 40.62/5.49 cnf(i_0_83, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c9|multiply(sk_c10,sk_c8)=sk_c9)).
% 40.62/5.49 cnf(i_0_95, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c5|multiply(sk_c10,sk_c8)=sk_c9)).
% 40.62/5.49 cnf(i_0_88, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c10|multiply(sk_c10,sk_c5)=sk_c9)).
% 40.62/5.49 cnf(i_0_90, negated_conjecture, (multiply(sk_c7,sk_c10)=sk_c8|multiply(sk_c10,sk_c5)=sk_c9)).
% 40.62/5.49 cnf(i_0_70, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c9|multiply(sk_c6,sk_c9)=sk_c10)).
% 40.62/5.49 cnf(i_0_82, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c9|multiply(sk_c6,sk_c9)=sk_c10)).
% 40.62/5.49 cnf(i_0_94, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c5|multiply(sk_c6,sk_c9)=sk_c10)).
% 40.62/5.49 cnf(i_0_72, negated_conjecture, (multiply(sk_c2,sk_c3)=sk_c9|multiply(sk_c7,sk_c10)=sk_c8)).
% 40.62/5.49 cnf(i_0_84, negated_conjecture, (multiply(sk_c3,sk_c10)=sk_c9|multiply(sk_c7,sk_c10)=sk_c8)).
% 40.62/5.49 cnf(i_0_96, negated_conjecture, (multiply(sk_c4,sk_c10)=sk_c5|multiply(sk_c7,sk_c10)=sk_c8)).
% 40.62/5.49 cnf(i_0_104, 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(X1)!=sk_c10|inverse(X4)!=sk_c10|inverse(X2)!=sk_c10|inverse(X5)!=sk_c10)).
% 40.62/5.49 cnf(i_0_6753, plain, (X9=X9)).
% 40.62/5.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 40.62/5.49 # Begin printing tableau
% 40.62/5.49 # Found 6 steps
% 40.62/5.49 cnf(i_0_6753, plain, (X6=X6), inference(start_rule)).
% 40.62/5.49 cnf(i_0_6869, plain, (X6=X6), inference(extension_rule, [i_0_6757])).
% 40.62/5.49 cnf(i_0_6986, plain, (multiply(identity,X5)!=X5), inference(closure_rule, [i_0_53])).
% 40.62/5.49 cnf(i_0_6984, plain, (multiply(X6,multiply(identity,X5))=multiply(X6,X5)), inference(extension_rule, [i_0_6758])).
% 40.62/5.49 cnf(i_0_333867, plain, (inverse(multiply(X6,multiply(identity,X5)))=inverse(multiply(X6,X5))), inference(extension_rule, [i_0_6758])).
% 40.62/5.49 cnf(i_0_505577, plain, (inverse(inverse(multiply(X6,multiply(identity,X5))))=inverse(inverse(multiply(X6,X5)))), inference(etableau_closure_rule, [i_0_505577, ...])).
% 40.62/5.49 # End printing tableau
% 40.62/5.49 # SZS output end
% 40.62/5.49 # Branches closed with saturation will be marked with an "s"
% 40.62/5.49 # Child (2030) has found a proof.
% 40.62/5.49
% 40.62/5.49 # Proof search is over...
% 40.62/5.49 # Freeing feature tree
%------------------------------------------------------------------------------