TSTP Solution File: GRP098-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP098-1 : TPTP v8.1.0. Bugfixed v2.7.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 : n025.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:04:24 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP098-1 : TPTP v8.1.0. Bugfixed v2.7.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.12/0.33 % Computer : n025.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 04:44:54 EDT 2022
% 0.12/0.34 % 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: 2 Number of unprocessed: 2
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.19/0.45 # The folding up rule is enabled...
% 0.19/0.45 # Local unification is enabled...
% 0.19/0.45 # Any saturation attempts will use folding labels...
% 0.19/0.45 # 2 beginning clauses after preprocessing and clausification
% 0.19/0.45 # Creating start rules for all 1 conjectures.
% 0.19/0.45 # There are 1 start rule candidates:
% 0.19/0.45 # Found 1 unit axioms.
% 0.19/0.45 # 1 start rule tableaux created.
% 0.19/0.45 # 1 extension rule candidate clauses
% 0.19/0.45 # 1 unit axiom clauses
% 0.19/0.45
% 0.19/0.45 # Requested 8, 32 cores available to the main process.
% 0.19/0.45 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.45 # Creating equality axioms
% 0.19/0.45 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.45 # There were 1 total branch saturation attempts.
% 0.19/0.45 # There were 0 of these attempts blocked.
% 0.19/0.45 # There were 0 deferred branch saturation attempts.
% 0.19/0.45 # There were 0 free duplicated saturations.
% 0.19/0.45 # There were 1 total successful branch saturations.
% 0.19/0.45 # There were 0 successful branch saturations in interreduction.
% 0.19/0.45 # There were 0 successful branch saturations on the branch.
% 0.19/0.45 # There were 1 successful branch saturations after the branch.
% 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Begin clausification derivation
% 0.19/0.45
% 0.19/0.45 # End clausification derivation
% 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.45 cnf(i_0_4, plain, (divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3))=X2)).
% 0.19/0.45 cnf(i_0_6, negated_conjecture, (divide(divide(a3,inverse(b3)),inverse(c3))!=divide(a3,inverse(divide(b3,inverse(c3))))|divide(inverse(a1),inverse(a1))!=divide(inverse(b1),inverse(b1))|divide(divide(inverse(b2),inverse(b2)),inverse(a2))!=a2|divide(a4,inverse(b4))!=divide(b4,inverse(a4)))).
% 0.19/0.45 cnf(i_0_27, plain, (X4=X4)).
% 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.45 # Begin printing tableau
% 0.19/0.45 # Found 6 steps
% 0.19/0.45 cnf(i_0_4, plain, (divide(divide(divide(X10,inverse(divide(X1,X3))),X11),divide(X10,X11))=divide(X1,X3)), inference(start_rule)).
% 0.19/0.45 cnf(i_0_33, plain, (divide(divide(divide(X10,inverse(divide(X1,X3))),X11),divide(X10,X11))=divide(X1,X3)), inference(extension_rule, [i_0_32])).
% 0.19/0.45 cnf(i_0_53, plain, (divide(divide(divide(X16,inverse(divide(divide(X1,inverse(X9)),X3))),X14),divide(X16,X14))!=divide(divide(X1,inverse(X9)),X3)), inference(closure_rule, [i_0_4])).
% 0.19/0.45 cnf(i_0_52, plain, (divide(divide(divide(divide(X16,inverse(divide(divide(X1,inverse(X9)),X3))),X14),divide(X16,X14)),divide(divide(divide(X10,inverse(divide(X1,X3))),X11),divide(X10,X11)))=divide(divide(divide(X1,inverse(X9)),X3),divide(X1,X3))), inference(extension_rule, [i_0_30])).
% 0.19/0.45 cnf(i_0_65, plain, (divide(divide(divide(X1,inverse(X9)),X3),divide(X1,X3))!=X9), inference(closure_rule, [i_0_4])).
% 0.19/0.45 cnf(i_0_63, plain, (divide(divide(divide(divide(X16,inverse(divide(divide(X1,inverse(X9)),X3))),X14),divide(X16,X14)),divide(divide(divide(X10,inverse(divide(X1,X3))),X11),divide(X10,X11)))=X9), inference(etableau_closure_rule, [i_0_63, ...])).
% 0.19/0.45 # End printing tableau
% 0.19/0.45 # SZS output end
% 0.19/0.45 # Branches closed with saturation will be marked with an "s"
% 0.19/0.45 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.45 # We now have 7 tableaux to operate on
% 0.19/0.45 # Found closed tableau during pool population.
% 0.19/0.45 # Proof search is over...
% 0.19/0.45 # Freeing feature tree
%------------------------------------------------------------------------------