TSTP Solution File: BOO009-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : BOO009-1 : TPTP v8.1.0. Released v1.0.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 : n019.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:23 EDT 2022
% Result : Unsatisfiable 0.21s 0.44s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : BOO009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 1 21:25:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 # No SInE strategy applied
% 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.14/0.39 # and selection function SelectCQIPrecWNTNp.
% 0.14/0.39 #
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39 # Number of axioms: 23 Number of unprocessed: 23
% 0.14/0.39 # Tableaux proof search.
% 0.14/0.39 # APR header successfully linked.
% 0.14/0.39 # Hello from C++
% 0.21/0.41 # The folding up rule is enabled...
% 0.21/0.41 # Local unification is enabled...
% 0.21/0.41 # Any saturation attempts will use folding labels...
% 0.21/0.41 # 23 beginning clauses after preprocessing and clausification
% 0.21/0.41 # Creating start rules for all 1 conjectures.
% 0.21/0.41 # There are 1 start rule candidates:
% 0.21/0.41 # Found 11 unit axioms.
% 0.21/0.41 # 1 start rule tableaux created.
% 0.21/0.41 # 12 extension rule candidate clauses
% 0.21/0.41 # 11 unit axiom clauses
% 0.21/0.41
% 0.21/0.41 # Requested 8, 32 cores available to the main process.
% 0.21/0.41 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.44 # There were 2 total branch saturation attempts.
% 0.21/0.44 # There were 0 of these attempts blocked.
% 0.21/0.44 # There were 0 deferred branch saturation attempts.
% 0.21/0.44 # There were 0 free duplicated saturations.
% 0.21/0.44 # There were 2 total successful branch saturations.
% 0.21/0.44 # There were 0 successful branch saturations in interreduction.
% 0.21/0.44 # There were 0 successful branch saturations on the branch.
% 0.21/0.44 # There were 2 successful branch saturations after the branch.
% 0.21/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.44 # Begin clausification derivation
% 0.21/0.44
% 0.21/0.44 # End clausification derivation
% 0.21/0.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.44 cnf(i_0_31, plain, (product(X1,multiplicative_identity,X1))).
% 0.21/0.44 cnf(i_0_30, plain, (product(multiplicative_identity,X1,X1))).
% 0.21/0.44 cnf(i_0_29, plain, (sum(X1,additive_identity,X1))).
% 0.21/0.44 cnf(i_0_28, plain, (sum(additive_identity,X1,X1))).
% 0.21/0.44 cnf(i_0_41, plain, (sum(X1,inverse(X1),multiplicative_identity))).
% 0.21/0.44 cnf(i_0_43, plain, (product(X1,inverse(X1),additive_identity))).
% 0.21/0.44 cnf(i_0_40, plain, (sum(inverse(X1),X1,multiplicative_identity))).
% 0.21/0.44 cnf(i_0_42, plain, (product(inverse(X1),X1,additive_identity))).
% 0.21/0.44 cnf(i_0_24, plain, (sum(X1,X2,add(X1,X2)))).
% 0.21/0.44 cnf(i_0_25, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.21/0.44 cnf(i_0_46, negated_conjecture, (~product(x,add(x,y),x))).
% 0.21/0.44 cnf(i_0_26, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 0.21/0.44 cnf(i_0_27, plain, (product(X1,X2,X3)|~product(X2,X1,X3))).
% 0.21/0.44 cnf(i_0_45, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.21/0.44 cnf(i_0_44, plain, (X1=X2|~sum(X3,X4,X2)|~sum(X3,X4,X1))).
% 0.21/0.44 cnf(i_0_35, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))).
% 0.21/0.44 cnf(i_0_39, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X1)|~sum(X7,X2,X5)|~sum(X6,X2,X4))).
% 0.21/0.44 cnf(i_0_32, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))).
% 0.21/0.44 cnf(i_0_34, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))).
% 0.21/0.44 cnf(i_0_37, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X7,X2)|~sum(X1,X7,X5)|~sum(X1,X6,X4))).
% 0.21/0.44 cnf(i_0_38, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X6,X7,X3)|~sum(X5,X7,X2)|~sum(X4,X7,X1))).
% 0.21/0.44 cnf(i_0_36, plain, (product(X1,X2,X3)|~product(X4,X5,X6)|~sum(X7,X6,X3)|~sum(X7,X5,X2)|~sum(X7,X4,X1))).
% 0.21/0.44 cnf(i_0_33, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))).
% 0.21/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.44 # Begin printing tableau
% 0.21/0.44 # Found 10 steps
% 0.21/0.44 cnf(i_0_46, negated_conjecture, (~product(x,add(x,y),x)), inference(start_rule)).
% 0.21/0.44 cnf(i_0_47, plain, (~product(x,add(x,y),x)), inference(extension_rule, [i_0_33])).
% 0.21/0.44 cnf(i_0_94, plain, (~product(x,multiplicative_identity,x)), inference(closure_rule, [i_0_31])).
% 0.21/0.44 cnf(i_0_95, plain, (~product(x,multiplicative_identity,x)), inference(closure_rule, [i_0_31])).
% 0.21/0.44 cnf(i_0_96, plain, (~sum(x,x,x)), inference(extension_rule, [i_0_39])).
% 0.21/0.44 cnf(i_0_114, plain, (~product(x,multiplicative_identity,x)), inference(closure_rule, [i_0_31])).
% 0.21/0.44 cnf(i_0_116, plain, (~sum(inverse(x),x,multiplicative_identity)), inference(closure_rule, [i_0_40])).
% 0.21/0.44 cnf(i_0_117, plain, (~sum(additive_identity,x,x)), inference(closure_rule, [i_0_28])).
% 0.21/0.44 cnf(i_0_97, plain, (~sum(multiplicative_identity,multiplicative_identity,add(x,y))), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.21/0.44 cnf(i_0_115, plain, (~product(additive_identity,inverse(x),x)), inference(etableau_closure_rule, [i_0_115, ...])).
% 0.21/0.44 # End printing tableau
% 0.21/0.44 # SZS output end
% 0.21/0.44 # Branches closed with saturation will be marked with an "s"
% 0.21/0.44 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.44 # We now have 5 tableaux to operate on
% 0.21/0.44 # Found closed tableau during pool population.
% 0.21/0.44 # Proof search is over...
% 0.21/0.44 # Freeing feature tree
%------------------------------------------------------------------------------