TSTP Solution File: BOO022-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : BOO022-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 : n026.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 1.78s 0.59s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : BOO022-1 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 1 23:06:42 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 7 Number of unprocessed: 7
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 7 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 7 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 0 extension rule candidate clauses
% 0.14/0.37 # 7 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Creating equality axioms
% 0.14/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 14 tableaux to operate on
% 1.78/0.59 # There were 1 total branch saturation attempts.
% 1.78/0.59 # There were 0 of these attempts blocked.
% 1.78/0.59 # There were 0 deferred branch saturation attempts.
% 1.78/0.59 # There were 0 free duplicated saturations.
% 1.78/0.59 # There were 1 total successful branch saturations.
% 1.78/0.59 # There were 0 successful branch saturations in interreduction.
% 1.78/0.59 # There were 0 successful branch saturations on the branch.
% 1.78/0.59 # There were 1 successful branch saturations after the branch.
% 1.78/0.59 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.78/0.59 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.78/0.59 # Begin clausification derivation
% 1.78/0.59
% 1.78/0.59 # End clausification derivation
% 1.78/0.59 # Begin listing active clauses obtained from FOF to CNF conversion
% 1.78/0.59 cnf(i_0_10, plain, (add(X1,inverse(X1))=n1)).
% 1.78/0.59 cnf(i_0_13, plain, (multiply(X1,inverse(X1))=n0)).
% 1.78/0.59 cnf(i_0_11, plain, (add(multiply(X1,X2),X2)=X2)).
% 1.78/0.59 cnf(i_0_8, plain, (multiply(add(X1,X2),X2)=X2)).
% 1.78/0.59 cnf(i_0_12, plain, (multiply(add(X1,X2),add(X3,X2))=add(X2,multiply(X1,X3)))).
% 1.78/0.59 cnf(i_0_9, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(X2,add(X1,X3)))).
% 1.78/0.59 cnf(i_0_14, negated_conjecture, (multiply(multiply(a,b),c)!=multiply(a,multiply(b,c)))).
% 1.78/0.59 cnf(i_0_16, plain, (X4=X4)).
% 1.78/0.59 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 1.78/0.59 # Begin printing tableau
% 1.78/0.59 # Found 6 steps
% 1.78/0.59 cnf(i_0_10, plain, (add(X6,inverse(X6))=n1), inference(start_rule)).
% 1.78/0.59 cnf(i_0_23, plain, (add(X6,inverse(X6))=n1), inference(extension_rule, [i_0_20])).
% 1.78/0.59 cnf(i_0_40, plain, (add(X1,inverse(X1))!=n1), inference(closure_rule, [i_0_10])).
% 1.78/0.59 cnf(i_0_38, plain, (add(add(X6,inverse(X6)),add(X1,inverse(X1)))=add(n1,n1)), inference(extension_rule, [i_0_19])).
% 1.78/0.59 cnf(i_0_52, plain, (add(n1,n1)!=add(multiply(X1,add(n1,n1)),add(n1,n1))), inference(closure_rule, [i_0_11])).
% 1.78/0.59 cnf(i_0_50, plain, (add(add(X6,inverse(X6)),add(X1,inverse(X1)))=add(multiply(X1,add(n1,n1)),add(n1,n1))), inference(etableau_closure_rule, [i_0_50, ...])).
% 1.78/0.59 # End printing tableau
% 1.78/0.59 # SZS output end
% 1.78/0.59 # Branches closed with saturation will be marked with an "s"
% 1.78/0.60 # Child (31034) has found a proof.
% 1.78/0.60
% 1.78/0.60 # Proof search is over...
% 1.78/0.60 # Freeing feature tree
%------------------------------------------------------------------------------