TSTP Solution File: ALG300-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ALG300-1 : TPTP v8.1.0. Released v4.1.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 : n021.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 : Thu Jul 14 16:52:25 EDT 2022
% Result : Satisfiable 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG300-1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/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 : n021.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 : Wed Jun 8 09:01:22 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___209_C18_F1_AE_CS_SP_PI_S0Y
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 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.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 2 beginning clauses after preprocessing and clausification
% 0.12/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.12/0.36 # No conjectures.
% 0.12/0.36 # There are 2 start rule candidates:
% 0.12/0.36 # Found 2 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 2 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 2 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # 26928 Satisfiable branch
% 0.12/0.36 # Satisfiable branch found.
% 0.12/0.36 # There were 1 total branch saturation attempts.
% 0.12/0.36 # There were 0 of these attempts blocked.
% 0.12/0.36 # There were 0 deferred branch saturation attempts.
% 0.12/0.36 # There were 0 free duplicated saturations.
% 0.12/0.36 # There were 0 total successful branch saturations.
% 0.12/0.36 # There were 0 successful branch saturations in interreduction.
% 0.12/0.36 # There were 0 successful branch saturations on the branch.
% 0.12/0.36 # There were 0 successful branch saturations after the branch.
% 0.12/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Begin clausification derivation
% 0.12/0.36
% 0.12/0.36 # End clausification derivation
% 0.12/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.36 cnf(i_0_4, plain, (tptp1!=tptp0)).
% 0.12/0.36 cnf(i_0_3, plain, (product(product(product(product(X1,X1),X1),X2),product(X1,X3))=X2)).
% 0.12/0.36 cnf(i_0_7, plain, (X4=X4)).
% 0.12/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.36 # Begin printing tableau
% 0.12/0.36 # Found 5 steps
% 0.12/0.36 cnf(i_0_3, plain, (product(product(product(product(X9,X9),X9),product(X1,X3)),product(X9,X11))=product(X1,X3)), inference(start_rule)).
% 0.12/0.36 cnf(i_0_13, plain, (product(product(product(product(X9,X9),X9),product(X1,X3)),product(X9,X11))=product(X1,X3)), inference(extension_rule, [i_0_11])).
% 0.12/0.36 cnf(i_0_193, plain, (product(product(product(product(X16,X16),X16),product(product(product(X1,X1),X1),X8)),product(X16,X14))!=product(product(product(X1,X1),X1),X8)), inference(closure_rule, [i_0_3])).
% 0.12/0.36 cnf(i_0_192, plain, (product(product(product(product(product(X16,X16),X16),product(product(product(X1,X1),X1),X8)),product(X16,X14)),product(product(product(product(X9,X9),X9),product(X1,X3)),product(X9,X11)))=product(product(product(product(X1,X1),X1),X8),product(X1,X3))), inference(extension_rule, [i_0_10])).
% 0.12/0.36 cnf(i_0_201, plain, (product(product(product(product(X1,X1),X1),X8),product(X1,X3))!=X8), inference(closure_rule, [i_0_3])).
% 0.12/0.36 # End printing tableau
% 0.12/0.36 # SZS output end
% 0.12/0.36 # Branches closed with saturation will be marked with an "s"
% 0.12/0.36 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 5 tableaux to operate on
% 0.12/0.36 # Found closed tableau during pool population.
% 0.12/0.36 # Proof search is over...
% 0.12/0.36 # Freeing feature tree
%------------------------------------------------------------------------------