%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP002-10 : TPTP v8.1.0. Released v7.3.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 : Sat Jul 16 09:03:51 EDT 2022 % Result : Unsatisfiable 3.81s 0.90s % Output : CNFRefutation 3.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : GRP002-10 : TPTP v8.1.0. Released v7.3.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n024.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Mon Jun 13 17:37:48 EDT 2022 % 0.14/0.36 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.39 # % 0.21/0.39 # Presaturation interreduction done % 0.21/0.39 # Number of axioms: 18 Number of unprocessed: 18 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.39 # The folding up rule is enabled... % 0.21/0.39 # Local unification is enabled... % 0.21/0.39 # Any saturation attempts will use folding labels... % 0.21/0.39 # 18 beginning clauses after preprocessing and clausification % 0.21/0.39 # Creating start rules for all 6 conjectures. % 0.21/0.39 # There are 6 start rule candidates: % 0.21/0.39 # Found 18 unit axioms. % 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.39 # 6 start rule tableaux created. % 0.21/0.39 # 0 extension rule candidate clauses % 0.21/0.39 # 18 unit axiom clauses % 0.21/0.39 % 0.21/0.39 # Requested 8, 32 cores available to the main process. % 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 6 % 0.21/0.39 # Creating equality axioms % 0.21/0.39 # Ran out of tableaux, making start rules for all clauses % 0.21/0.39 # Returning from population with 34 new_tableaux and 0 remaining starting tableaux. % 0.21/0.39 # We now have 34 tableaux to operate on % 3.81/0.90 # There were 1 total branch saturation attempts. % 3.81/0.90 # There were 0 of these attempts blocked. % 3.81/0.90 # There were 0 deferred branch saturation attempts. % 3.81/0.90 # There were 0 free duplicated saturations. % 3.81/0.90 # There were 1 total successful branch saturations. % 3.81/0.90 # There were 0 successful branch saturations in interreduction. % 3.81/0.90 # There were 0 successful branch saturations on the branch. % 3.81/0.90 # There were 1 successful branch saturations after the branch. % 3.81/0.90 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.81/0.90 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.81/0.90 # Begin clausification derivation % 3.81/0.90 % 3.81/0.90 # End clausification derivation % 3.81/0.90 # Begin listing active clauses obtained from FOF to CNF conversion % 3.81/0.90 cnf(i_0_31, negated_conjecture, (product(a,b,c)=true)). % 3.81/0.90 cnf(i_0_34, negated_conjecture, (product(h,b,j)=true)). % 3.81/0.90 cnf(i_0_32, negated_conjecture, (product(c,inverse(a),d)=true)). % 3.81/0.90 cnf(i_0_33, negated_conjecture, (product(d,inverse(b),h)=true)). % 3.81/0.90 cnf(i_0_22, plain, (product(X1,identity,X1)=true)). % 3.81/0.90 cnf(i_0_35, negated_conjecture, (product(j,inverse(h),k)=true)). % 3.81/0.90 cnf(i_0_21, plain, (product(identity,X1,X1)=true)). % 3.81/0.90 cnf(i_0_19, plain, (ifeq2(X1,X1,X2,X3)=X2)). % 3.81/0.90 cnf(i_0_20, plain, (ifeq(X1,X1,X2,X3)=X2)). % 3.81/0.90 cnf(i_0_24, plain, (product(X1,inverse(X1),identity)=true)). % 3.81/0.90 cnf(i_0_23, plain, (product(inverse(X1),X1,identity)=true)). % 3.81/0.90 cnf(i_0_25, plain, (product(X1,X2,multiply(X1,X2))=true)). % 3.81/0.90 cnf(i_0_30, hypothesis, (ifeq(product(X1,X1,X2),true,product(X2,X1,identity),true)=true)). % 3.81/0.90 cnf(i_0_29, hypothesis, (ifeq(product(X1,X1,X2),true,product(X1,X2,identity),true)=true)). % 3.81/0.90 cnf(i_0_26, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)). % 3.81/0.90 cnf(i_0_28, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true)=true)). % 3.81/0.90 cnf(i_0_27, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true)=true)). % 3.81/0.90 cnf(i_0_36, negated_conjecture, (product(k,inverse(b),identity)!=true)). % 3.81/0.90 cnf(i_0_43, plain, (X7=X7)). % 3.81/0.90 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 3.81/0.90 # Begin printing tableau % 3.81/0.90 # Found 7 steps % 3.81/0.90 cnf(i_0_31, negated_conjecture, (product(a,b,c)=true), inference(start_rule)). % 3.81/0.90 cnf(i_0_52, plain, (product(a,b,c)=true), inference(extension_rule, [i_0_50])). % 3.81/0.90 cnf(i_0_92, plain, (inverse(product(a,b,c))=inverse(true)), inference(extension_rule, [i_0_47])). % 3.81/0.90 cnf(i_0_200, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_31])). % 3.81/0.90 cnf(i_0_201, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_31])). % 3.81/0.90 cnf(i_0_202, plain, (product(a,b,c)!=true), inference(closure_rule, [i_0_31])). % 3.81/0.90 cnf(i_0_198, plain, (ifeq2(inverse(product(a,b,c)),product(a,b,c),product(a,b,c),product(a,b,c))=ifeq2(inverse(true),true,true,true)), inference(etableau_closure_rule, [i_0_198, ...])). % 3.81/0.90 # End printing tableau % 3.81/0.90 # SZS output end % 3.81/0.90 # Branches closed with saturation will be marked with an "s" % 3.81/0.90 # Child (8655) has found a proof. % 3.81/0.90 % 3.81/0.90 # Proof search is over... % 3.81/0.90 # Freeing feature tree %------------------------------------------------------------------------------