TSTP Solution File: GRP453-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP453-1 : TPTP v8.1.0. Released v2.6.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 : n012.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:06:33 EDT 2022
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP453-1 : TPTP v8.1.0. Released v2.6.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.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 05:20:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 4 Number of unprocessed: 4
% 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.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 # 4 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 4 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 4 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 11 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 11 tableaux to operate on
% 0.19/0.54 # There were 1 total branch saturation attempts.
% 0.19/0.54 # There were 0 of these attempts blocked.
% 0.19/0.54 # There were 0 deferred branch saturation attempts.
% 0.19/0.54 # There were 0 free duplicated saturations.
% 0.19/0.54 # There were 1 total successful branch saturations.
% 0.19/0.54 # There were 0 successful branch saturations in interreduction.
% 0.19/0.54 # There were 0 successful branch saturations on the branch.
% 0.19/0.54 # There were 1 successful branch saturations after the branch.
% 0.19/0.54 # There were 1 total branch saturation attempts.
% 0.19/0.54 # There were 0 of these attempts blocked.
% 0.19/0.54 # There were 0 deferred branch saturation attempts.
% 0.19/0.54 # There were 0 free duplicated saturations.
% 0.19/0.54 # There were 1 total successful branch saturations.
% 0.19/0.54 # There were 0 successful branch saturations in interreduction.
% 0.19/0.54 # There were 0 successful branch saturations on the branch.
% 0.19/0.54 # There were 1 successful branch saturations after the branch.
% 0.19/0.54 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # Begin clausification derivation
% 0.19/0.54
% 0.19/0.54 # End clausification derivation
% 0.19/0.54 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.54 cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))).
% 0.19/0.54 cnf(i_0_5, plain, (divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3)=X2)).
% 0.19/0.54 cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.19/0.54 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.19/0.54 cnf(i_0_10, plain, (X4=X4)).
% 0.19/0.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.54 # Begin printing tableau
% 0.19/0.54 # Found 6 steps
% 0.19/0.54 cnf(i_0_6, plain, (divide(X17,divide(divide(X16,X16),X15))=multiply(X17,X15)), inference(start_rule)).
% 0.19/0.54 cnf(i_0_17, plain, (divide(X17,divide(divide(X16,X16),X15))=multiply(X17,X15)), inference(extension_rule, [i_0_15])).
% 0.19/0.54 cnf(i_0_33, plain, (divide(X1,divide(divide(multiply(multiply(X1,X3),multiply(X17,X15)),multiply(multiply(X1,X3),multiply(X17,X15))),X3))!=multiply(X1,X3)), inference(closure_rule, [i_0_6])).
% 0.19/0.54 cnf(i_0_32, plain, (multiply(divide(X1,divide(divide(multiply(multiply(X1,X3),multiply(X17,X15)),multiply(multiply(X1,X3),multiply(X17,X15))),X3)),divide(X17,divide(divide(X16,X16),X15)))=multiply(multiply(X1,X3),multiply(X17,X15))), inference(extension_rule, [i_0_13])).
% 0.19/0.54 cnf(i_0_43, plain, (multiply(multiply(X1,X3),multiply(X17,X15))!=divide(divide(divide(X1,X1),divide(X1,divide(multiply(multiply(X1,X3),multiply(X17,X15)),divide(divide(divide(X1,X1),X1),X3)))),X3)), inference(closure_rule, [i_0_5])).
% 0.19/0.54 cnf(i_0_41, plain, (multiply(divide(X1,divide(divide(multiply(multiply(X1,X3),multiply(X17,X15)),multiply(multiply(X1,X3),multiply(X17,X15))),X3)),divide(X17,divide(divide(X16,X16),X15)))=divide(divide(divide(X1,X1),divide(X1,divide(multiply(multiply(X1,X3),multiply(X17,X15)),divide(divide(divide(X1,X1),X1),X3)))),X3)), inference(etableau_closure_rule, [i_0_41, ...])).
% 0.19/0.54 # End printing tableau
% 0.19/0.54 # SZS output end
% 0.19/0.54 # Branches closed with saturation will be marked with an "s"
% 0.19/0.54 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 # Begin clausification derivation
% 0.19/0.54
% 0.19/0.54 # End clausification derivation
% 0.19/0.54 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.54 cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))).
% 0.19/0.54 cnf(i_0_5, plain, (divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3)=X2)).
% 0.19/0.54 cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.19/0.54 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.19/0.54 cnf(i_0_10, plain, (X4=X4)).
% 0.19/0.54 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.54 # Begin printing tableau
% 0.19/0.54 # Found 6 steps
% 0.19/0.54 cnf(i_0_6, plain, (divide(X9,divide(divide(X8,X8),X7))=multiply(X9,X7)), inference(start_rule)).
% 0.19/0.54 cnf(i_0_17, plain, (divide(X9,divide(divide(X8,X8),X7))=multiply(X9,X7)), inference(extension_rule, [i_0_13])).
% 0.19/0.54 cnf(i_0_28, plain, (divide(X9,divide(divide(X6,X6),X7))!=multiply(X9,X7)), inference(closure_rule, [i_0_6])).
% 0.19/0.54 cnf(i_0_26, plain, (divide(X9,divide(divide(X8,X8),X7))=divide(X9,divide(divide(X6,X6),X7))), inference(extension_rule, [i_0_15])).
% 0.19/0.54 cnf(i_0_93, plain, (divide(X1,divide(divide(X2,X2),X3))!=multiply(X1,X3)), inference(closure_rule, [i_0_6])).
% 0.19/0.54 cnf(i_0_91, plain, (multiply(divide(X9,divide(divide(X8,X8),X7)),divide(X1,divide(divide(X2,X2),X3)))=multiply(divide(X9,divide(divide(X6,X6),X7)),multiply(X1,X3))), inference(etableau_closure_rule, [i_0_91, ...])).
% 0.19/0.54 # End printing tableau
% 0.19/0.54 # SZS output end
% 0.19/0.54 # Branches closed with saturation will be marked with an "s"
% 0.19/0.55 # There were 1 total branch saturation attempts.
% 0.19/0.55 # There were 0 of these attempts blocked.
% 0.19/0.55 # There were 0 deferred branch saturation attempts.
% 0.19/0.55 # There were 0 free duplicated saturations.
% 0.19/0.55 # There were 1 total successful branch saturations.
% 0.19/0.55 # There were 0 successful branch saturations in interreduction.
% 0.19/0.55 # There were 0 successful branch saturations on the branch.
% 0.19/0.55 # There were 1 successful branch saturations after the branch.
% 0.19/0.55 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.55 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.55 # Begin clausification derivation
% 0.19/0.55
% 0.19/0.55 # End clausification derivation
% 0.19/0.55 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.55 cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))).
% 0.19/0.55 cnf(i_0_5, plain, (divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3)=X2)).
% 0.19/0.55 cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.19/0.55 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.19/0.55 cnf(i_0_10, plain, (X4=X4)).
% 0.19/0.55 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.55 # Begin printing tableau
% 0.19/0.55 # Found 6 steps
% 0.19/0.55 cnf(i_0_6, plain, (divide(X10,divide(divide(X9,X9),X8))=multiply(X10,X8)), inference(start_rule)).
% 0.19/0.55 cnf(i_0_17, plain, (divide(X10,divide(divide(X9,X9),X8))=multiply(X10,X8)), inference(extension_rule, [i_0_15])).
% 0.19/0.55 cnf(i_0_34, plain, (divide(X1,divide(divide(multiply(multiply(X10,X8),multiply(X1,X3)),multiply(multiply(X10,X8),multiply(X1,X3))),X3))!=multiply(X1,X3)), inference(closure_rule, [i_0_6])).
% 0.19/0.55 cnf(i_0_32, plain, (multiply(divide(X10,divide(divide(X9,X9),X8)),divide(X1,divide(divide(multiply(multiply(X10,X8),multiply(X1,X3)),multiply(multiply(X10,X8),multiply(X1,X3))),X3)))=multiply(multiply(X10,X8),multiply(X1,X3))), inference(extension_rule, [i_0_13])).
% 0.19/0.55 cnf(i_0_43, plain, (multiply(multiply(X10,X8),multiply(X1,X3))!=divide(divide(divide(X1,X1),divide(X1,divide(multiply(multiply(X10,X8),multiply(X1,X3)),divide(divide(divide(X1,X1),X1),X3)))),X3)), inference(closure_rule, [i_0_5])).
% 0.19/0.55 cnf(i_0_41, plain, (multiply(divide(X10,divide(divide(X9,X9),X8)),divide(X1,divide(divide(multiply(multiply(X10,X8),multiply(X1,X3)),multiply(multiply(X10,X8),multiply(X1,X3))),X3)))=divide(divide(divide(X1,X1),divide(X1,divide(multiply(multiply(X10,X8),multiply(X1,X3)),divide(divide(divide(X1,X1),X1),X3)))),X3)), inference(etableau_closure_rule, [i_0_41, ...])).
% 0.19/0.55 # End printing tableau
% 0.19/0.55 # SZS output end
% 0.19/0.55 # Branches closed with saturation will be marked with an "s"
% 0.19/0.55 # Child (15514) has found a proof.
% 0.19/0.55
% 0.19/0.55 # Proof search is over...
% 0.19/0.55 # Freeing feature tree
%------------------------------------------------------------------------------