TSTP Solution File: GRP120-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP120-1 : TPTP v8.1.0. Released v1.2.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 : n010.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:29 EDT 2022
% Result : Unsatisfiable 0.10s 0.28s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : GRP120-1 : TPTP v8.1.0. Released v1.2.0.
% 0.02/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.06/0.25 % Computer : n010.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Mon Jun 13 03:59:39 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.10/0.27 # No SInE strategy applied
% 0.10/0.27 # Auto-Mode selected heuristic G_E___209_C18_F1_AE_CS_SP_PI_S0Y
% 0.10/0.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.10/0.27 #
% 0.10/0.27 # Number of axioms: 3 Number of unprocessed: 3
% 0.10/0.27 # Tableaux proof search.
% 0.10/0.27 # APR header successfully linked.
% 0.10/0.27 # Hello from C++
% 0.10/0.28 # The folding up rule is enabled...
% 0.10/0.28 # Local unification is enabled...
% 0.10/0.28 # Any saturation attempts will use folding labels...
% 0.10/0.28 # 3 beginning clauses after preprocessing and clausification
% 0.10/0.28 # Creating start rules for all 1 conjectures.
% 0.10/0.28 # There are 1 start rule candidates:
% 0.10/0.28 # Found 3 unit axioms.
% 0.10/0.28 # 1 start rule tableaux created.
% 0.10/0.28 # 0 extension rule candidate clauses
% 0.10/0.28 # 3 unit axiom clauses
% 0.10/0.28
% 0.10/0.28 # Requested 8, 32 cores available to the main process.
% 0.10/0.28 # There are not enough tableaux to fork, creating more from the initial 1
% 0.10/0.28 # Creating equality axioms
% 0.10/0.28 # Ran out of tableaux, making start rules for all clauses
% 0.10/0.28 # There were 1 total branch saturation attempts.
% 0.10/0.28 # There were 0 of these attempts blocked.
% 0.10/0.28 # There were 0 deferred branch saturation attempts.
% 0.10/0.28 # There were 0 free duplicated saturations.
% 0.10/0.28 # There were 1 total successful branch saturations.
% 0.10/0.28 # There were 0 successful branch saturations in interreduction.
% 0.10/0.28 # There were 0 successful branch saturations on the branch.
% 0.10/0.28 # There were 1 successful branch saturations after the branch.
% 0.10/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.28 # Begin clausification derivation
% 0.10/0.28
% 0.10/0.28 # End clausification derivation
% 0.10/0.28 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.10/0.28 cnf(i_0_5, plain, (multiply(identity,identity)=identity)).
% 0.10/0.28 cnf(i_0_6, negated_conjecture, (multiply(identity,a)!=a)).
% 0.10/0.28 cnf(i_0_4, plain, (multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X1),multiply(X2,X3))),multiply(X3,multiply(X3,X3))))=X2)).
% 0.10/0.28 cnf(i_0_8, plain, (X4=X4)).
% 0.10/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.10/0.28 # Begin printing tableau
% 0.10/0.28 # Found 6 steps
% 0.10/0.28 cnf(i_0_5, plain, (multiply(identity,identity)=identity), inference(start_rule)).
% 0.10/0.28 cnf(i_0_13, plain, (multiply(identity,identity)=identity), inference(extension_rule, [i_0_12])).
% 0.10/0.28 cnf(i_0_25, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_5])).
% 0.10/0.28 cnf(i_0_24, plain, (multiply(multiply(identity,identity),multiply(identity,identity))=multiply(identity,identity)), inference(extension_rule, [i_0_11])).
% 0.10/0.28 cnf(i_0_33, plain, (multiply(identity,identity)!=identity), inference(closure_rule, [i_0_5])).
% 0.10/0.28 cnf(i_0_31, plain, (multiply(multiply(identity,identity),multiply(identity,identity))=identity), inference(etableau_closure_rule, [i_0_31, ...])).
% 0.10/0.28 # End printing tableau
% 0.10/0.28 # SZS output end
% 0.10/0.28 # Branches closed with saturation will be marked with an "s"
% 0.10/0.28 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.10/0.28 # We now have 8 tableaux to operate on
% 0.10/0.28 # Found closed tableau during pool population.
% 0.10/0.28 # Proof search is over...
% 0.10/0.28 # Freeing feature tree
%------------------------------------------------------------------------------