TSTP Solution File: GRP394+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP394+3 : 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:06:17 EDT 2022
% Result : Satisfiable 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP394+3 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % 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 : n017.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 04:29:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr
% 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 3 Number of unprocessed: 3
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 3 beginning clauses after preprocessing and clausification
% 0.18/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.18/0.36 # No conjectures.
% 0.18/0.36 # There are 3 start rule candidates:
% 0.18/0.36 # Found 3 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 3 start rule tableaux created.
% 0.18/0.36 # 0 extension rule candidate clauses
% 0.18/0.36 # 3 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.36 # Creating equality axioms
% 0.18/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.36 # 16373 Satisfiable branch
% 0.18/0.36 # Satisfiable branch found.
% 0.18/0.36 # There were 1 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 0 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 0 successful branch saturations after the branch.
% 0.18/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_1, plain, (multiply(identity,X1)=X1)).
% 0.18/0.36 cnf(i_0_2, plain, (multiply(inverse(X1),X1)=identity)).
% 0.18/0.36 cnf(i_0_3, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.18/0.36 cnf(i_0_7, plain, (X9=X9)).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 4 steps
% 0.18/0.36 cnf(i_0_1, plain, (multiply(identity,X5)=X5), inference(start_rule)).
% 0.18/0.36 cnf(i_0_13, plain, (multiply(identity,X5)=X5), inference(extension_rule, [i_0_12])).
% 0.18/0.36 cnf(i_0_27, plain, (inverse(multiply(identity,X5))=inverse(X5)), inference(extension_rule, [i_0_10])).
% 0.18/0.36 cnf(i_0_35, plain, (inverse(X5)!=multiply(identity,inverse(X5))), inference(closure_rule, [i_0_1])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 8 tableaux to operate on
% 0.18/0.36 # Found closed tableau during pool population.
% 0.18/0.36 # Proof search is over...
% 0.18/0.36 # Freeing feature tree
%------------------------------------------------------------------------------