TSTP Solution File: BOO026-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : BOO026-1 : TPTP v8.1.0. Released v2.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 : n029.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 23:38:28 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : BOO026-1 : TPTP v8.1.0. Released v2.2.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 : n029.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 1 20:19:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 11 Number of unprocessed: 11
% 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 # 11 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 11 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 11 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 1
% 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 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 18 tableaux to operate on
% 0.19/0.43 # There were 1 total branch saturation attempts.
% 0.19/0.43 # There were 0 of these attempts blocked.
% 0.19/0.43 # There were 0 deferred branch saturation attempts.
% 0.19/0.43 # There were 0 free duplicated saturations.
% 0.19/0.43 # There were 1 total successful branch saturations.
% 0.19/0.43 # There were 0 successful branch saturations in interreduction.
% 0.19/0.43 # There were 0 successful branch saturations on the branch.
% 0.19/0.43 # There were 1 successful branch saturations after the branch.
% 0.19/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # Begin clausification derivation
% 0.19/0.43
% 0.19/0.43 # End clausification derivation
% 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.43 cnf(i_0_13, plain, (add(X1,inverse(X1))=n1)).
% 0.19/0.43 cnf(i_0_15, plain, (multiply(X1,inverse(X1))=n0)).
% 0.19/0.43 cnf(i_0_14, plain, (multiply(add(X1,X2),add(X3,X2))=add(X2,multiply(X1,X3)))).
% 0.19/0.43 cnf(i_0_12, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(X2,add(X1,X3)))).
% 0.19/0.43 cnf(i_0_17, plain, (add(multiply(X1,inverse(X2)),multiply(X2,add(X1,inverse(X2))))=X1)).
% 0.19/0.43 cnf(i_0_18, plain, (add(multiply(X1,inverse(X2)),multiply(X1,add(X1,inverse(X2))))=X1)).
% 0.19/0.43 cnf(i_0_16, plain, (add(n0,multiply(X1,n1))=X1)).
% 0.19/0.43 cnf(i_0_20, plain, (multiply(add(X1,inverse(X2)),add(X2,multiply(X1,inverse(X2))))=X1)).
% 0.19/0.43 cnf(i_0_21, plain, (multiply(add(X1,inverse(X2)),add(X1,multiply(X1,inverse(X2))))=X1)).
% 0.19/0.43 cnf(i_0_19, plain, (multiply(n1,add(X1,n0))=X1)).
% 0.19/0.43 cnf(i_0_22, negated_conjecture, (multiply(add(a,b),b)!=b)).
% 0.19/0.43 cnf(i_0_24, plain, (X4=X4)).
% 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.43 # Begin printing tableau
% 0.19/0.43 # Found 6 steps
% 0.19/0.43 cnf(i_0_13, plain, (add(X6,inverse(X6))=n1), inference(start_rule)).
% 0.19/0.43 cnf(i_0_31, plain, (add(X6,inverse(X6))=n1), inference(extension_rule, [i_0_27])).
% 0.19/0.43 cnf(i_0_49, plain, (add(X7,inverse(X7))!=n1), inference(closure_rule, [i_0_13])).
% 0.19/0.43 cnf(i_0_47, plain, (add(X6,inverse(X6))=add(X7,inverse(X7))), inference(extension_rule, [i_0_29])).
% 0.19/0.43 cnf(i_0_114, plain, (add(X1,inverse(X1))!=n1), inference(closure_rule, [i_0_13])).
% 0.19/0.43 cnf(i_0_112, plain, (multiply(add(X6,inverse(X6)),add(X1,inverse(X1)))=multiply(add(X7,inverse(X7)),n1)), inference(etableau_closure_rule, [i_0_112, ...])).
% 0.19/0.43 # End printing tableau
% 0.19/0.43 # SZS output end
% 0.19/0.43 # Branches closed with saturation will be marked with an "s"
% 0.19/0.43 # Child (29126) has found a proof.
% 0.19/0.43
% 0.19/0.43 # Proof search is over...
% 0.19/0.43 # Freeing feature tree
%------------------------------------------------------------------------------