TSTP Solution File: GRP091-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP091-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 : n006.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:22 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP091-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/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.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 00:34:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.13/0.37 # and selection function SelectNewComplexAHP.
% 0.13/0.37 #
% 0.13/0.37 # Number of axioms: 5 Number of unprocessed: 5
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 5 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 4 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 1 extension rule candidate clauses
% 0.13/0.37 # 4 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 12 tableaux to operate on
% 0.19/0.52 # There were 1 total branch saturation attempts.
% 0.19/0.52 # There were 0 of these attempts blocked.
% 0.19/0.52 # There were 0 deferred branch saturation attempts.
% 0.19/0.52 # There were 0 free duplicated saturations.
% 0.19/0.52 # There were 1 total successful branch saturations.
% 0.19/0.52 # There were 0 successful branch saturations in interreduction.
% 0.19/0.52 # There were 0 successful branch saturations on the branch.
% 0.19/0.52 # There were 1 successful branch saturations after the branch.
% 0.19/0.52 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52 # Begin clausification derivation
% 0.19/0.52
% 0.19/0.52 # End clausification derivation
% 0.19/0.52 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.52 cnf(i_0_9, plain, (divide(X1,X1)=identity)).
% 0.19/0.52 cnf(i_0_8, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.19/0.52 cnf(i_0_7, plain, (divide(X1,divide(divide(X3,X3),X2))=multiply(X1,X2))).
% 0.19/0.52 cnf(i_0_6, plain, (divide(divide(X1,divide(divide(X1,X2),X3)),X2)=X3)).
% 0.19/0.52 cnf(i_0_10, negated_conjecture, (multiply(a4,b4)!=multiply(b4,a4)|multiply(multiply(inverse(b2),b2),a2)!=a2|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.19/0.52 cnf(i_0_31, plain, (X4=X4)).
% 0.19/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.52 # Begin printing tableau
% 0.19/0.52 # Found 6 steps
% 0.19/0.52 cnf(i_0_9, plain, (divide(X6,X6)=identity), inference(start_rule)).
% 0.19/0.52 cnf(i_0_38, plain, (divide(X6,X6)=identity), inference(extension_rule, [i_0_34])).
% 0.19/0.52 cnf(i_0_57, plain, (divide(X11,X11)!=identity), inference(closure_rule, [i_0_9])).
% 0.19/0.52 cnf(i_0_55, plain, (divide(X6,X6)=divide(X11,X11)), inference(extension_rule, [i_0_35])).
% 0.19/0.52 cnf(i_0_150, plain, (divide(X1,X1)!=identity), inference(closure_rule, [i_0_9])).
% 0.19/0.52 cnf(i_0_148, plain, (divide(divide(X6,X6),divide(X1,X1))=divide(divide(X11,X11),identity)), inference(etableau_closure_rule, [i_0_148, ...])).
% 0.19/0.52 # End printing tableau
% 0.19/0.52 # SZS output end
% 0.19/0.52 # Branches closed with saturation will be marked with an "s"
% 0.19/0.52 # Child (26739) has found a proof.
% 0.19/0.52 # There were 1 total branch saturation attempts.
% 0.19/0.52 # There were 0 of these attempts blocked.
% 0.19/0.52 # There were 0 deferred branch saturation attempts.
% 0.19/0.52 # There were 0 free duplicated saturations.
% 0.19/0.52 # There were 1 total successful branch saturations.
% 0.19/0.52 # There were 0 successful branch saturations in interreduction.
% 0.19/0.52 # There were 0 successful branch saturations on the branch.
% 0.19/0.52 # There were 1 successful branch saturations after the branch.
% 0.19/0.52
% 0.19/0.52 # Proof search is over...
% 0.19/0.52 # Freeing feature tree
%------------------------------------------------------------------------------