TSTP Solution File: GRP777-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP777-10 : 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 : n009.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:25 EDT 2022
% Result : Unsatisfiable 2.14s 0.65s
% Output : CNFRefutation 2.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP777-10 : TPTP v8.1.0. Released v8.1.0.
% 0.06/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 : n009.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 : Tue Jun 14 04:02:38 EDT 2022
% 0.12/0.34 % 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: 9 Number of unprocessed: 9
% 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 # 9 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 9 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 9 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 16 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 16 tableaux to operate on
% 2.14/0.65 # There were 1 total branch saturation attempts.
% 2.14/0.65 # There were 0 of these attempts blocked.
% 2.14/0.65 # There were 0 deferred branch saturation attempts.
% 2.14/0.65 # There were 0 free duplicated saturations.
% 2.14/0.65 # There were 1 total successful branch saturations.
% 2.14/0.65 # There were 0 successful branch saturations in interreduction.
% 2.14/0.65 # There were 0 successful branch saturations on the branch.
% 2.14/0.65 # There were 1 successful branch saturations after the branch.
% 2.14/0.65 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/0.65 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/0.65 # Begin clausification derivation
% 2.14/0.65
% 2.14/0.65 # End clausification derivation
% 2.14/0.65 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.14/0.65 cnf(i_0_16, plain, (product(X1,X1)=X1)).
% 2.14/0.65 cnf(i_0_12, plain, (product(X1,difference(X1,X2))=X2)).
% 2.14/0.65 cnf(i_0_11, plain, (difference(X1,product(X1,X2))=X2)).
% 2.14/0.65 cnf(i_0_14, plain, (product(quotient(X1,X2),X2)=X1)).
% 2.14/0.65 cnf(i_0_13, plain, (quotient(product(X1,X2),X2)=X1)).
% 2.14/0.65 cnf(i_0_19, plain, (product(product(a,c),product(c,b))=product(a,b))).
% 2.14/0.65 cnf(i_0_15, plain, (product(product(X1,X2),product(X3,X4))=product(product(X1,X3),product(X2,X4)))).
% 2.14/0.65 cnf(i_0_20, negated_conjecture, (product(product(a,b),product(x0,a))!=product(product(c,c),product(x0,c)))).
% 2.14/0.65 cnf(i_0_17, plain, (product(product(product(X1,X2),X2),product(X2,product(X2,X1)))=X2)).
% 2.14/0.65 cnf(i_0_22, plain, (X5=X5)).
% 2.14/0.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.14/0.65 # Begin printing tableau
% 2.14/0.65 # Found 6 steps
% 2.14/0.65 cnf(i_0_16, plain, (product(X4,X4)=X4), inference(start_rule)).
% 2.14/0.65 cnf(i_0_29, plain, (product(X4,X4)=X4), inference(extension_rule, [i_0_26])).
% 2.14/0.65 cnf(i_0_47, plain, (product(X4,X4)!=X4), inference(closure_rule, [i_0_16])).
% 2.14/0.65 cnf(i_0_46, plain, (product(product(X4,X4),product(X4,X4))=product(X4,X4)), inference(extension_rule, [i_0_25])).
% 2.14/0.65 cnf(i_0_61, plain, (product(X4,X4)!=X4), inference(closure_rule, [i_0_16])).
% 2.14/0.65 cnf(i_0_59, plain, (product(product(X4,X4),product(X4,X4))=X4), inference(etableau_closure_rule, [i_0_59, ...])).
% 2.14/0.65 # End printing tableau
% 2.14/0.65 # SZS output end
% 2.14/0.65 # Branches closed with saturation will be marked with an "s"
% 2.14/0.66 # Child (26219) has found a proof.
% 2.14/0.66
% 2.14/0.66 # Proof search is over...
% 2.14/0.66 # Freeing feature tree
%------------------------------------------------------------------------------