%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.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 : n022.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:04 EDT 2022 % Result : Unsatisfiable 0.22s 0.41s % Output : CNFRefutation 0.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.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.15/0.36 % Computer : n022.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Tue Jun 14 09:41:33 EDT 2022 % 0.15/0.36 % CPUTime : % 0.22/0.38 # No SInE strategy applied % 0.22/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.22/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.22/0.38 # % 0.22/0.38 # Number of axioms: 9 Number of unprocessed: 9 % 0.22/0.38 # Tableaux proof search. % 0.22/0.38 # APR header successfully linked. % 0.22/0.38 # Hello from C++ % 0.22/0.39 # The folding up rule is enabled... % 0.22/0.39 # Local unification is enabled... % 0.22/0.39 # Any saturation attempts will use folding labels... % 0.22/0.39 # 9 beginning clauses after preprocessing and clausification % 0.22/0.39 # Creating start rules for all 1 conjectures. % 0.22/0.39 # There are 1 start rule candidates: % 0.22/0.39 # Found 9 unit axioms. % 0.22/0.39 # 1 start rule tableaux created. % 0.22/0.39 # 0 extension rule candidate clauses % 0.22/0.39 # 9 unit axiom clauses % 0.22/0.39 % 0.22/0.39 # Requested 8, 32 cores available to the main process. % 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.22/0.39 # Creating equality axioms % 0.22/0.39 # Ran out of tableaux, making start rules for all clauses % 0.22/0.39 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.22/0.39 # We now have 16 tableaux to operate on % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.22/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.22/0.41 # Begin clausification derivation % 0.22/0.41 % 0.22/0.41 # End clausification derivation % 0.22/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.41 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.22/0.41 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.22/0.41 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.22/0.41 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.22/0.41 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.22/0.41 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.22/0.41 cnf(i_0_18, negated_conjecture, (mult(mult(a,c),ld(c,mult(b,c)))!=mult(mult(a,b),c))). % 0.22/0.41 cnf(i_0_17, plain, (mult(mult(X1,mult(X2,mult(X2,X3))),X2)=mult(mult(X1,X2),mult(X2,mult(X3,X2))))). % 0.22/0.41 cnf(i_0_16, plain, (mult(mult(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(mult(mult(X2,X1),X1),X3)))). % 0.22/0.41 cnf(i_0_20, plain, (X4=X4)). % 0.22/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.41 # Begin printing tableau % 0.22/0.41 # Found 6 steps % 0.22/0.41 cnf(i_0_14, plain, (mult(unit,unit)=unit), inference(start_rule)). % 0.22/0.41 cnf(i_0_27, plain, (mult(unit,unit)=unit), inference(extension_rule, [i_0_25])). % 0.22/0.41 cnf(i_0_48, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_14])). % 0.22/0.41 cnf(i_0_47, plain, (mult(mult(X7,unit),mult(unit,unit))=mult(X7,unit)), inference(extension_rule, [i_0_23])). % 0.22/0.41 cnf(i_0_59, plain, (mult(X7,unit)!=X7), inference(closure_rule, [i_0_14])). % 0.22/0.41 cnf(i_0_57, plain, (mult(mult(X7,unit),mult(unit,unit))=X7), inference(etableau_closure_rule, [i_0_57, ...])). % 0.22/0.41 # End printing tableau % 0.22/0.41 # SZS output end % 0.22/0.41 # Branches closed with saturation will be marked with an "s" % 0.22/0.41 # There were 1 total branch saturation attempts. % 0.22/0.41 # There were 0 of these attempts blocked. % 0.22/0.41 # There were 0 deferred branch saturation attempts. % 0.22/0.41 # There were 0 free duplicated saturations. % 0.22/0.41 # There were 1 total successful branch saturations. % 0.22/0.41 # There were 0 successful branch saturations in interreduction. % 0.22/0.41 # There were 0 successful branch saturations on the branch. % 0.22/0.41 # There were 1 successful branch saturations after the branch. % 0.22/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.22/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.22/0.41 # Begin clausification derivation % 0.22/0.41 % 0.22/0.41 # End clausification derivation % 0.22/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.22/0.41 cnf(i_0_14, plain, (mult(X1,unit)=X1)). % 0.22/0.41 cnf(i_0_15, plain, (mult(unit,X1)=X1)). % 0.22/0.41 cnf(i_0_11, plain, (ld(X1,mult(X1,X2))=X2)). % 0.22/0.41 cnf(i_0_10, plain, (mult(X1,ld(X1,X2))=X2)). % 0.22/0.41 cnf(i_0_12, plain, (mult(rd(X1,X2),X2)=X1)). % 0.22/0.41 cnf(i_0_13, plain, (rd(mult(X1,X2),X2)=X1)). % 0.22/0.41 cnf(i_0_18, negated_conjecture, (mult(mult(a,c),ld(c,mult(b,c)))!=mult(mult(a,b),c))). % 0.22/0.41 cnf(i_0_17, plain, (mult(mult(X1,mult(X2,mult(X2,X3))),X2)=mult(mult(X1,X2),mult(X2,mult(X3,X2))))). % 0.22/0.41 cnf(i_0_16, plain, (mult(mult(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(mult(mult(X2,X1),X1),X3)))). % 0.22/0.41 cnf(i_0_20, plain, (X4=X4)). % 0.22/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.22/0.41 # Begin printing tableau % 0.22/0.41 # Found 6 steps % 0.22/0.41 cnf(i_0_14, plain, (mult(mult(mult(a,b),c),unit)=mult(mult(a,b),c)), inference(start_rule)). % 0.22/0.41 cnf(i_0_27, plain, (mult(mult(mult(a,b),c),unit)=mult(mult(a,b),c)), inference(extension_rule, [i_0_23])). % 0.22/0.41 cnf(i_0_41, plain, (mult(mult(a,c),ld(c,mult(b,c)))=mult(mult(a,b),c)), inference(closure_rule, [i_0_18])). % 0.22/0.41 cnf(i_0_42, plain, (mult(mult(a,c),ld(c,mult(b,c)))!=mult(mult(mult(a,b),c),unit)), inference(extension_rule, [i_0_23])). % 0.22/0.41 cnf(i_0_58, plain, (mult(mult(a,c),ld(c,mult(b,c)))!=mult(mult(mult(a,c),ld(c,mult(b,c))),unit)), inference(closure_rule, [i_0_14])). % 0.22/0.41 cnf(i_0_59, plain, (mult(mult(mult(a,c),ld(c,mult(b,c))),unit)!=mult(mult(mult(a,b),c),unit)), inference(etableau_closure_rule, [i_0_59, ...])). % 0.22/0.41 # End printing tableau % 0.22/0.41 # SZS output end % 0.22/0.41 # Branches closed with saturation will be marked with an "s" % 0.22/0.41 # Child (19217) has found a proof. % 0.22/0.41 % 0.22/0.41 # Proof search is over... % 0.22/0.41 # Freeing feature tree %------------------------------------------------------------------------------