TSTP Solution File: GRP702-11 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP702-11 : TPTP v8.1.0. Released v8.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 : n010.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 : Sat Jul 16 09:08:05 EDT 2022
% Result : Unsatisfiable 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% 0.11/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 : n010.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 : Tue Jun 14 05:18:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.14/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 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 # 14 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 14 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 0 extension rule candidate clauses
% 0.14/0.37 # 14 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 21 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 21 tableaux to operate on
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_19, plain, (mult(X1,unit)=X1)).
% 0.14/0.38 cnf(i_0_20, plain, (mult(unit,X1)=X1)).
% 0.14/0.38 cnf(i_0_25, plain, (ld(X1,mult(op_c,X1))=op_d)).
% 0.14/0.38 cnf(i_0_16, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_15, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_17, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_18, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_24, plain, (mult(mult(X1,op_c),X2)=mult(X1,mult(op_c,X2)))).
% 0.14/0.38 cnf(i_0_23, plain, (mult(mult(X1,X2),op_c)=mult(X1,mult(X2,op_c)))).
% 0.14/0.38 cnf(i_0_22, plain, (mult(mult(op_c,X1),X2)=mult(op_c,mult(X1,X2)))).
% 0.14/0.38 cnf(i_0_28, negated_conjecture, (mult(mult(x0,x1),op_d)!=mult(x0,mult(x1,op_d)))).
% 0.14/0.38 cnf(i_0_21, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))).
% 0.14/0.38 cnf(i_0_27, plain, (mult(X1,mult(X2,ld(mult(X1,X2),op_c)))=op_f)).
% 0.14/0.38 cnf(i_0_26, plain, (mult(mult(rd(op_c,mult(X1,X2)),X2),X1)=op_e)).
% 0.14/0.38 cnf(i_0_30, plain, (X4=X4)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_19, plain, (mult(X5,unit)=X5), inference(start_rule)).
% 0.14/0.38 cnf(i_0_37, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_36])).
% 0.14/0.38 cnf(i_0_66, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_65, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_33])).
% 0.14/0.38 cnf(i_0_74, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_72, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_19, plain, (mult(X1,unit)=X1)).
% 0.14/0.38 cnf(i_0_20, plain, (mult(unit,X1)=X1)).
% 0.14/0.38 cnf(i_0_25, plain, (ld(X1,mult(op_c,X1))=op_d)).
% 0.14/0.38 cnf(i_0_16, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_15, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_17, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_18, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_24, plain, (mult(mult(X1,op_c),X2)=mult(X1,mult(op_c,X2)))).
% 0.14/0.38 cnf(i_0_23, plain, (mult(mult(X1,X2),op_c)=mult(X1,mult(X2,op_c)))).
% 0.14/0.38 cnf(i_0_22, plain, (mult(mult(op_c,X1),X2)=mult(op_c,mult(X1,X2)))).
% 0.14/0.38 cnf(i_0_28, negated_conjecture, (mult(mult(x0,x1),op_d)!=mult(x0,mult(x1,op_d)))).
% 0.14/0.38 cnf(i_0_21, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))).
% 0.14/0.38 cnf(i_0_27, plain, (mult(X1,mult(X2,ld(mult(X1,X2),op_c)))=op_f)).
% 0.14/0.38 cnf(i_0_26, plain, (mult(mult(rd(op_c,mult(X1,X2)),X2),X1)=op_e)).
% 0.14/0.38 cnf(i_0_30, plain, (X4=X4)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_19, plain, (mult(X3,unit)=X3), inference(start_rule)).
% 0.14/0.38 cnf(i_0_37, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_36])).
% 0.14/0.38 cnf(i_0_67, plain, (mult(X5,unit)!=X5), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_65, plain, (rd(mult(X3,unit),mult(X5,unit))=rd(X3,X5)), inference(extension_rule, [i_0_33])).
% 0.14/0.38 cnf(i_0_74, plain, (rd(X3,X5)!=mult(rd(X3,X5),unit)), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_72, plain, (rd(mult(X3,unit),mult(X5,unit))=mult(rd(X3,X5),unit)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # There were 1 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 0 free duplicated saturations.
% 0.14/0.38 # There were 1 total successful branch saturations.
% 0.14/0.38 # There were 0 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 1 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_19, plain, (mult(X1,unit)=X1)).
% 0.14/0.38 cnf(i_0_20, plain, (mult(unit,X1)=X1)).
% 0.14/0.38 cnf(i_0_25, plain, (ld(X1,mult(op_c,X1))=op_d)).
% 0.14/0.38 cnf(i_0_16, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_15, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_17, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_18, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_24, plain, (mult(mult(X1,op_c),X2)=mult(X1,mult(op_c,X2)))).
% 0.14/0.38 cnf(i_0_23, plain, (mult(mult(X1,X2),op_c)=mult(X1,mult(X2,op_c)))).
% 0.14/0.38 cnf(i_0_22, plain, (mult(mult(op_c,X1),X2)=mult(op_c,mult(X1,X2)))).
% 0.14/0.38 cnf(i_0_28, negated_conjecture, (mult(mult(x0,x1),op_d)!=mult(x0,mult(x1,op_d)))).
% 0.14/0.38 cnf(i_0_21, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))).
% 0.14/0.38 cnf(i_0_27, plain, (mult(X1,mult(X2,ld(mult(X1,X2),op_c)))=op_f)).
% 0.14/0.38 cnf(i_0_26, plain, (mult(mult(rd(op_c,mult(X1,X2)),X2),X1)=op_e)).
% 0.14/0.38 cnf(i_0_30, plain, (X4=X4)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_19, plain, (mult(X7,unit)=X7), inference(start_rule)).
% 0.14/0.38 cnf(i_0_37, plain, (mult(X7,unit)=X7), inference(extension_rule, [i_0_35])).
% 0.14/0.38 cnf(i_0_64, plain, (mult(unit,unit)!=unit), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_62, plain, (mult(mult(X7,unit),mult(unit,unit))=mult(X7,unit)), inference(extension_rule, [i_0_33])).
% 0.14/0.38 cnf(i_0_74, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_72, plain, (mult(mult(X7,unit),mult(unit,unit))=X7), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_19, plain, (mult(X1,unit)=X1)).
% 0.14/0.38 cnf(i_0_20, plain, (mult(unit,X1)=X1)).
% 0.14/0.38 cnf(i_0_25, plain, (ld(X1,mult(op_c,X1))=op_d)).
% 0.14/0.38 cnf(i_0_16, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_15, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.14/0.38 cnf(i_0_17, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_18, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.14/0.38 cnf(i_0_24, plain, (mult(mult(X1,op_c),X2)=mult(X1,mult(op_c,X2)))).
% 0.14/0.38 cnf(i_0_23, plain, (mult(mult(X1,X2),op_c)=mult(X1,mult(X2,op_c)))).
% 0.14/0.38 cnf(i_0_22, plain, (mult(mult(op_c,X1),X2)=mult(op_c,mult(X1,X2)))).
% 0.14/0.38 cnf(i_0_28, negated_conjecture, (mult(mult(x0,x1),op_d)!=mult(x0,mult(x1,op_d)))).
% 0.14/0.38 cnf(i_0_21, plain, (mult(mult(mult(X1,X2),X2),X3)=mult(X1,mult(X2,mult(X2,X3))))).
% 0.14/0.38 cnf(i_0_27, plain, (mult(X1,mult(X2,ld(mult(X1,X2),op_c)))=op_f)).
% 0.14/0.38 cnf(i_0_26, plain, (mult(mult(rd(op_c,mult(X1,X2)),X2),X1)=op_e)).
% 0.14/0.38 cnf(i_0_30, plain, (X4=X4)).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 6 steps
% 0.14/0.38 cnf(i_0_19, plain, (mult(X5,unit)=X5), inference(start_rule)).
% 0.14/0.38 cnf(i_0_37, plain, (mult(X5,unit)=X5), inference(extension_rule, [i_0_34])).
% 0.14/0.38 cnf(i_0_60, plain, (mult(X3,unit)!=X3), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_59, plain, (ld(mult(X3,unit),mult(X5,unit))=ld(X3,X5)), inference(extension_rule, [i_0_33])).
% 0.14/0.38 cnf(i_0_74, plain, (ld(X3,X5)!=mult(ld(X3,X5),unit)), inference(closure_rule, [i_0_19])).
% 0.14/0.38 cnf(i_0_72, plain, (ld(mult(X3,unit),mult(X5,unit))=mult(ld(X3,X5),unit)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (28297) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------