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