TSTP Solution File: GRP767-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP767-1 : TPTP v8.1.0. Released v4.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 : n013.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:23 EDT 2022
% Result : Unsatisfiable 9.39s 1.60s
% Output : CNFRefutation 9.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP767-1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/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 : n013.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 : Mon Jun 13 20:34:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.18/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 16 Number of unprocessed: 16
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 16 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 1 conjectures.
% 0.18/0.36 # There are 1 start rule candidates:
% 0.18/0.36 # Found 16 unit axioms.
% 0.18/0.36 # 1 start rule tableaux created.
% 0.18/0.36 # 0 extension rule candidate clauses
% 0.18/0.36 # 16 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.36 # Creating equality axioms
% 0.18/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.18/0.36 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 23 tableaux to operate on
% 9.39/1.60 # There were 1 total branch saturation attempts.
% 9.39/1.60 # There were 0 of these attempts blocked.
% 9.39/1.60 # There were 0 deferred branch saturation attempts.
% 9.39/1.60 # There were 0 free duplicated saturations.
% 9.39/1.60 # There were 1 total successful branch saturations.
% 9.39/1.60 # There were 0 successful branch saturations in interreduction.
% 9.39/1.60 # There were 0 successful branch saturations on the branch.
% 9.39/1.60 # There were 1 successful branch saturations after the branch.
% 9.39/1.60 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.39/1.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.39/1.60 # Begin clausification derivation
% 9.39/1.60
% 9.39/1.60 # End clausification derivation
% 9.39/1.60 # Begin listing active clauses obtained from FOF to CNF conversion
% 9.39/1.60 cnf(i_0_22, plain, (product(X1,one)=X1)).
% 9.39/1.60 cnf(i_0_23, plain, (product(one,X1)=X1)).
% 9.39/1.60 cnf(i_0_24, plain, (product(X1,difference(X1,X2))=X2)).
% 9.39/1.60 cnf(i_0_25, plain, (difference(X1,product(X1,X2))=X2)).
% 9.39/1.60 cnf(i_0_27, plain, (product(quotient(X1,X2),X2)=X1)).
% 9.39/1.60 cnf(i_0_26, plain, (quotient(product(X1,X2),X2)=X1)).
% 9.39/1.60 cnf(i_0_32, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))).
% 9.39/1.60 cnf(i_0_28, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))).
% 9.39/1.60 cnf(i_0_36, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))).
% 9.39/1.60 cnf(i_0_37, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))).
% 9.39/1.60 cnf(i_0_29, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))).
% 9.39/1.60 cnf(i_0_39, plain, (product(difference(product(X1,X1),product(X1,product(X1,X2))),difference(product(X1,X1),product(X1,product(X1,X3))))=difference(product(X1,X1),product(X1,product(X1,product(X2,X3)))))).
% 9.39/1.60 cnf(i_0_41, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))).
% 9.39/1.60 cnf(i_0_34, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))).
% 9.39/1.60 cnf(i_0_35, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))).
% 9.39/1.60 cnf(i_0_42, negated_conjecture, (product(x0,product(product(x0,quotient(one,x0)),quotient(one,product(x1,x0))))!=quotient(one,x1))).
% 9.39/1.60 cnf(i_0_44, plain, (X4=X4)).
% 9.39/1.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 9.39/1.60 # Begin printing tableau
% 9.39/1.60 # Found 6 steps
% 9.39/1.60 cnf(i_0_22, plain, (product(X7,one)=X7), inference(start_rule)).
% 9.39/1.60 cnf(i_0_51, plain, (product(X7,one)=X7), inference(extension_rule, [i_0_48])).
% 9.39/1.60 cnf(i_0_77, plain, (product(one,one)!=one), inference(closure_rule, [i_0_22])).
% 9.39/1.60 cnf(i_0_75, plain, (product(product(X7,one),product(one,one))=product(X7,one)), inference(extension_rule, [i_0_47])).
% 9.39/1.60 cnf(i_0_90, plain, (product(X7,one)!=X7), inference(closure_rule, [i_0_22])).
% 9.39/1.60 cnf(i_0_88, plain, (product(product(X7,one),product(one,one))=X7), inference(etableau_closure_rule, [i_0_88, ...])).
% 9.39/1.60 # End printing tableau
% 9.39/1.60 # SZS output end
% 9.39/1.60 # Branches closed with saturation will be marked with an "s"
% 9.39/1.60 # There were 1 total branch saturation attempts.
% 9.39/1.60 # There were 0 of these attempts blocked.
% 9.39/1.60 # There were 0 deferred branch saturation attempts.
% 9.39/1.60 # There were 0 free duplicated saturations.
% 9.39/1.60 # There were 1 total successful branch saturations.
% 9.39/1.60 # There were 0 successful branch saturations in interreduction.
% 9.39/1.60 # There were 0 successful branch saturations on the branch.
% 9.39/1.60 # There were 1 successful branch saturations after the branch.
% 9.39/1.60 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.39/1.60 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.39/1.60 # Begin clausification derivation
% 9.39/1.60
% 9.39/1.60 # End clausification derivation
% 9.39/1.60 # Begin listing active clauses obtained from FOF to CNF conversion
% 9.39/1.60 cnf(i_0_22, plain, (product(X1,one)=X1)).
% 9.39/1.60 cnf(i_0_23, plain, (product(one,X1)=X1)).
% 9.39/1.60 cnf(i_0_24, plain, (product(X1,difference(X1,X2))=X2)).
% 9.39/1.60 cnf(i_0_25, plain, (difference(X1,product(X1,X2))=X2)).
% 9.39/1.60 cnf(i_0_27, plain, (product(quotient(X1,X2),X2)=X1)).
% 9.39/1.60 cnf(i_0_26, plain, (quotient(product(X1,X2),X2)=X1)).
% 9.39/1.60 cnf(i_0_32, plain, (product(difference(X1,one),X1)=product(X1,quotient(one,X1)))).
% 9.39/1.60 cnf(i_0_28, plain, (difference(X1,product(product(X1,X2),X3))=quotient(product(X2,product(X3,X1)),X1))).
% 9.39/1.60 cnf(i_0_36, plain, (product(product(X1,X2),product(X1,quotient(one,X1)))=product(X1,product(X2,product(X1,quotient(one,X1)))))).
% 9.39/1.60 cnf(i_0_37, plain, (product(product(product(X1,quotient(one,X1)),X2),X3)=product(product(X1,quotient(one,X1)),product(X2,X3)))).
% 9.39/1.60 cnf(i_0_29, plain, (quotient(quotient(product(X1,product(X2,X3)),X3),X2)=difference(product(X2,X3),product(X2,product(X3,X1))))).
% 9.39/1.60 cnf(i_0_39, plain, (product(difference(product(X1,X1),product(X1,product(X1,X2))),difference(product(X1,X1),product(X1,product(X1,X3))))=difference(product(X1,X1),product(X1,product(X1,product(X2,X3)))))).
% 9.39/1.60 cnf(i_0_41, plain, (product(quotient(product(product(X1,quotient(one,X1)),X2),product(X1,quotient(one,X1))),quotient(product(product(X1,quotient(one,X1)),X3),product(X1,quotient(one,X1))))=quotient(product(product(X1,quotient(one,X1)),product(X2,X3)),product(X1,quotient(one,X1))))).
% 9.39/1.60 cnf(i_0_34, plain, (product(difference(difference(X1,one),one),X2)=product(product(X1,quotient(one,X1)),product(X1,X2)))).
% 9.39/1.60 cnf(i_0_35, plain, (product(X1,product(product(X1,quotient(one,X1)),X2))=product(quotient(one,quotient(one,X1)),X2))).
% 9.39/1.60 cnf(i_0_42, negated_conjecture, (product(x0,product(product(x0,quotient(one,x0)),quotient(one,product(x1,x0))))!=quotient(one,x1))).
% 9.39/1.60 cnf(i_0_44, plain, (X4=X4)).
% 9.39/1.60 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 9.39/1.60 # Begin printing tableau
% 9.39/1.60 # Found 6 steps
% 9.39/1.60 cnf(i_0_22, plain, (product(X5,one)=X5), inference(start_rule)).
% 9.39/1.60 cnf(i_0_51, plain, (product(X5,one)=X5), inference(extension_rule, [i_0_50])).
% 9.39/1.60 cnf(i_0_82, plain, (product(X3,one)!=X3), inference(closure_rule, [i_0_22])).
% 9.39/1.60 cnf(i_0_81, plain, (quotient(product(X3,one),product(X5,one))=quotient(X3,X5)), inference(extension_rule, [i_0_47])).
% 9.39/1.60 cnf(i_0_90, plain, (quotient(X3,X5)!=product(quotient(X3,X5),one)), inference(closure_rule, [i_0_22])).
% 9.39/1.60 cnf(i_0_88, plain, (quotient(product(X3,one),product(X5,one))=product(quotient(X3,X5),one)), inference(etableau_closure_rule, [i_0_88, ...])).
% 9.39/1.60 # End printing tableau
% 9.39/1.60 # SZS output end
% 9.39/1.60 # Branches closed with saturation will be marked with an "s"
% 9.39/1.60 # Child (2596) has found a proof.
% 9.39/1.60
% 9.39/1.60 # Proof search is over...
% 9.39/1.60 # Freeing feature tree
%------------------------------------------------------------------------------