TSTP Solution File: ALG245-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ALG245-1 : TPTP v8.1.0. Released v4.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 : n024.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:15 EDT 2022
% Result : Unsatisfiable 3.92s 0.85s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ALG245-1 : TPTP v8.1.0. Released v4.0.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 : n024.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 08:50:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.12/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Number of axioms: 6 Number of unprocessed: 6
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 6 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 6 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 6 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 9 tableaux to operate on
% 3.92/0.85 # There were 1 total branch saturation attempts.
% 3.92/0.85 # There were 0 of these attempts blocked.
% 3.92/0.85 # There were 0 deferred branch saturation attempts.
% 3.92/0.85 # There were 0 free duplicated saturations.
% 3.92/0.85 # There were 1 total successful branch saturations.
% 3.92/0.85 # There were 0 successful branch saturations in interreduction.
% 3.92/0.85 # There were 0 successful branch saturations on the branch.
% 3.92/0.85 # There were 1 successful branch saturations after the branch.
% 3.92/0.85 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/0.85 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/0.85 # Begin clausification derivation
% 3.92/0.85
% 3.92/0.85 # End clausification derivation
% 3.92/0.85 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.92/0.85 cnf(i_0_11, plain, (mult(X1,X1)=X1)).
% 3.92/0.85 cnf(i_0_7, plain, (mult(mult(X1,X2),mult(X1,X3))=mult(X1,mult(X2,X3)))).
% 3.92/0.85 cnf(i_0_8, plain, (mult(mult(X1,X3),mult(X2,X3))=mult(mult(X1,X2),X3))).
% 3.92/0.85 cnf(i_0_12, negated_conjecture, (mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d)))!=mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))))).
% 3.92/0.85 cnf(i_0_9, plain, (mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))))=mult(mult(X1,X3),mult(X2,X4)))).
% 3.92/0.85 cnf(i_0_10, plain, (mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4)))=mult(mult(X1,X2),mult(X3,X4)))).
% 3.92/0.85 cnf(i_0_14, plain, (X5=X5)).
% 3.92/0.85 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.92/0.85 # Begin printing tableau
% 3.92/0.85 # Found 6 steps
% 3.92/0.85 cnf(i_0_10, plain, (mult(mult(mult(mult(X4,X2),mult(X4,X4)),mult(mult(X4,X4),mult(X2,X4))),mult(mult(X4,X4),mult(X2,X4)))=mult(mult(X4,X2),mult(X4,X4))), inference(start_rule)).
% 3.92/0.85 cnf(i_0_24, plain, (mult(mult(mult(mult(X4,X2),mult(X4,X4)),mult(mult(X4,X4),mult(X2,X4))),mult(mult(X4,X4),mult(X2,X4)))=mult(mult(X4,X2),mult(X4,X4))), inference(extension_rule, [i_0_17])).
% 3.92/0.85 cnf(i_0_42, plain, (mult(mult(X4,X2),mult(X4,X4))!=mult(X4,mult(X2,X4))), inference(closure_rule, [i_0_7])).
% 3.92/0.85 cnf(i_0_40, plain, (mult(mult(mult(mult(X4,X2),mult(X4,X4)),mult(mult(X4,X4),mult(X2,X4))),mult(mult(X4,X4),mult(X2,X4)))=mult(X4,mult(X2,X4))), inference(extension_rule, [i_0_18])).
% 3.92/0.85 cnf(i_0_49, plain, (mult(X6,X6)!=X6), inference(closure_rule, [i_0_11])).
% 3.92/0.85 cnf(i_0_47, plain, (mult(mult(mult(mult(mult(X4,X2),mult(X4,X4)),mult(mult(X4,X4),mult(X2,X4))),mult(mult(X4,X4),mult(X2,X4))),mult(X6,X6))=mult(mult(X4,mult(X2,X4)),X6)), inference(etableau_closure_rule, [i_0_47, ...])).
% 3.92/0.85 # End printing tableau
% 3.92/0.85 # SZS output end
% 3.92/0.85 # Branches closed with saturation will be marked with an "s"
% 3.92/0.85 # There were 1 total branch saturation attempts.
% 3.92/0.85 # There were 0 of these attempts blocked.
% 3.92/0.85 # There were 0 deferred branch saturation attempts.
% 3.92/0.85 # There were 0 free duplicated saturations.
% 3.92/0.85 # There were 1 total successful branch saturations.
% 3.92/0.85 # There were 0 successful branch saturations in interreduction.
% 3.92/0.85 # There were 0 successful branch saturations on the branch.
% 3.92/0.85 # There were 1 successful branch saturations after the branch.
% 3.92/0.85 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/0.85 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/0.85 # Begin clausification derivation
% 3.92/0.85
% 3.92/0.85 # End clausification derivation
% 3.92/0.85 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.92/0.85 cnf(i_0_11, plain, (mult(X1,X1)=X1)).
% 3.92/0.85 cnf(i_0_7, plain, (mult(mult(X1,X2),mult(X1,X3))=mult(X1,mult(X2,X3)))).
% 3.92/0.85 cnf(i_0_8, plain, (mult(mult(X1,X3),mult(X2,X3))=mult(mult(X1,X2),X3))).
% 3.92/0.85 cnf(i_0_12, negated_conjecture, (mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d)))!=mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))))).
% 3.92/0.85 cnf(i_0_9, plain, (mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))))=mult(mult(X1,X3),mult(X2,X4)))).
% 3.92/0.85 cnf(i_0_10, plain, (mult(mult(mult(mult(X1,X2),mult(X3,X4)),mult(mult(X1,X3),mult(X2,X4))),mult(mult(X1,X3),mult(X2,X4)))=mult(mult(X1,X2),mult(X3,X4)))).
% 3.92/0.85 cnf(i_0_14, plain, (X5=X5)).
% 3.92/0.85 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.92/0.85 # Begin printing tableau
% 3.92/0.85 # Found 6 steps
% 3.92/0.85 cnf(i_0_9, plain, (mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(X4,X4),mult(X4,X4))))=mult(mult(X4,X4),mult(X4,X4))), inference(start_rule)).
% 3.92/0.85 cnf(i_0_23, plain, (mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(X4,X4),mult(X4,X4))))=mult(mult(X4,X4),mult(X4,X4))), inference(extension_rule, [i_0_17])).
% 3.92/0.85 cnf(i_0_42, plain, (mult(mult(X4,X4),mult(X4,X4))!=mult(X4,mult(X4,X4))), inference(closure_rule, [i_0_7])).
% 3.92/0.85 cnf(i_0_40, plain, (mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(X4,X4),mult(X4,X4))))=mult(X4,mult(X4,X4))), inference(extension_rule, [i_0_18])).
% 3.92/0.85 cnf(i_0_49, plain, (mult(X5,X5)!=X5), inference(closure_rule, [i_0_11])).
% 3.92/0.85 cnf(i_0_47, plain, (mult(mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(mult(X4,X4),mult(X4,X4)),mult(mult(X4,X4),mult(X4,X4)))),mult(X5,X5))=mult(mult(X4,mult(X4,X4)),X5)), inference(etableau_closure_rule, [i_0_47, ...])).
% 3.92/0.85 # End printing tableau
% 3.92/0.85 # SZS output end
% 3.92/0.85 # Branches closed with saturation will be marked with an "s"
% 3.92/0.85 # Child (10963) has found a proof.
% 3.92/0.85
% 3.92/0.85 # Proof search is over...
% 3.92/0.85 # Freeing feature tree
%------------------------------------------------------------------------------