%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT002-1 : TPTP v8.1.0. Released v1.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 : Thu Jul 14 23:59:52 EDT 2022 % Result : Unsatisfiable 0.80s 0.98s % Output : CNFRefutation 0.80s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.11 % Problem : CAT002-1 : TPTP v8.1.0. Released v1.0.0. % 0.04/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 : n022.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 : Sun May 29 15:49:08 EDT 2022 % 0.12/0.33 % 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_S4d % 0.12/0.36 # and selection function SelectCQIPrecWNTNp. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 24 Number of unprocessed: 24 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.38/0.60 # The folding up rule is enabled... % 0.38/0.60 # Local unification is enabled... % 0.38/0.60 # Any saturation attempts will use folding labels... % 0.38/0.60 # 24 beginning clauses after preprocessing and clausification % 0.38/0.60 # Creating start rules for all 1 conjectures. % 0.38/0.60 # There are 1 start rule candidates: % 0.38/0.60 # Found 10 unit axioms. % 0.38/0.60 # 1 start rule tableaux created. % 0.38/0.60 # 14 extension rule candidate clauses % 0.38/0.60 # 10 unit axiom clauses % 0.38/0.60 % 0.38/0.60 # Requested 8, 32 cores available to the main process. % 0.38/0.60 # There are not enough tableaux to fork, creating more from the initial 1 % 0.80/0.98 # There were 3 total branch saturation attempts. % 0.80/0.98 # There were 0 of these attempts blocked. % 0.80/0.98 # There were 0 deferred branch saturation attempts. % 0.80/0.98 # There were 0 free duplicated saturations. % 0.80/0.98 # There were 3 total successful branch saturations. % 0.80/0.98 # There were 0 successful branch saturations in interreduction. % 0.80/0.98 # There were 0 successful branch saturations on the branch. % 0.80/0.98 # There were 3 successful branch saturations after the branch. % 0.80/0.98 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.80/0.98 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.80/0.98 # Begin clausification derivation % 0.80/0.98 % 0.80/0.98 # End clausification derivation % 0.80/0.98 # Begin listing active clauses obtained from FOF to CNF conversion % 0.80/0.98 cnf(i_0_34, plain, (identity_map(domain(X1)))). % 0.80/0.98 cnf(i_0_35, plain, (identity_map(codomain(X1)))). % 0.80/0.98 cnf(i_0_46, hypothesis, (product(c,h,d))). % 0.80/0.98 cnf(i_0_47, hypothesis, (product(c,g,d))). % 0.80/0.98 cnf(i_0_36, plain, (defined(X1,domain(X1)))). % 0.80/0.98 cnf(i_0_37, plain, (defined(codomain(X1),X1))). % 0.80/0.98 cnf(i_0_45, hypothesis, (product(a,b,c))). % 0.80/0.98 cnf(i_0_38, plain, (product(X1,domain(X1),X1))). % 0.80/0.98 cnf(i_0_39, plain, (product(codomain(X1),X1,X1))). % 0.80/0.98 cnf(i_0_48, negated_conjecture, (g!=h)). % 0.80/0.98 cnf(i_0_26, plain, (defined(X1,X2)|~product(X1,X2,X3))). % 0.80/0.98 cnf(i_0_25, plain, (product(X1,X2,compose(X1,X2))|~defined(X1,X2))). % 0.80/0.98 cnf(i_0_43, hypothesis, (X1=X2|~product(a,X2,X3)|~product(a,X1,X3))). % 0.80/0.98 cnf(i_0_44, hypothesis, (X1=X2|~product(b,X2,X3)|~product(b,X1,X3))). % 0.80/0.98 cnf(i_0_42, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.80/0.98 cnf(i_0_40, plain, (product(X1,X2,X2)|~identity_map(X1)|~defined(X1,X2))). % 0.80/0.98 cnf(i_0_33, plain, (defined(X1,X2)|~identity_map(X3)|~defined(X3,X2)|~defined(X1,X3))). % 0.80/0.98 cnf(i_0_41, plain, (product(X1,X2,X1)|~identity_map(X2)|~defined(X1,X2))). % 0.80/0.98 cnf(i_0_30, plain, (defined(X1,X2)|~product(X2,X3,X4)|~defined(X1,X4))). % 0.80/0.98 cnf(i_0_27, plain, (defined(X1,X2)|~product(X3,X1,X4)|~defined(X4,X2))). % 0.80/0.98 cnf(i_0_31, plain, (defined(X1,X2)|~product(X3,X4,X1)|~product(X4,X2,X5)|~defined(X3,X5))). % 0.80/0.98 cnf(i_0_28, plain, (defined(X1,X2)|~product(X3,X4,X2)|~product(X1,X3,X5)|~defined(X5,X4))). % 0.80/0.98 cnf(i_0_32, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X1)|~product(X6,X2,X5))). % 0.80/0.98 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.80/0.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.80/0.98 # Begin printing tableau % 0.80/0.98 # Found 9 steps % 0.80/0.98 cnf(i_0_48, negated_conjecture, (g!=h), inference(start_rule)). % 0.80/0.98 cnf(i_0_49, plain, (g!=h), inference(extension_rule, [i_0_42])). % 0.80/0.98 cnf(i_0_61, plain, (~product(h,domain(h),h)), inference(closure_rule, [i_0_38])). % 0.80/0.98 cnf(i_0_62, plain, (~product(h,domain(h),g)), inference(extension_rule, [i_0_29])). % 0.80/0.98 cnf(i_0_137, plain, (~product(g,domain(g),g)), inference(closure_rule, [i_0_38])). % 0.80/0.98 cnf(i_0_139, plain, (~product(h,g,g)), inference(extension_rule, [i_0_40])). % 0.80/0.98 cnf(i_0_138, plain, (~product(g,domain(g),domain(h))), inference(etableau_closure_rule, [i_0_138, ...])). % 0.80/0.98 cnf(i_0_199, plain, (~identity_map(h)), inference(etableau_closure_rule, [i_0_199, ...])). % 0.80/0.98 cnf(i_0_200, plain, (~defined(h,g)), inference(etableau_closure_rule, [i_0_200, ...])). % 0.80/0.98 # End printing tableau % 0.80/0.98 # SZS output end % 0.80/0.98 # Branches closed with saturation will be marked with an "s" % 0.80/0.98 # Returning from population with 6 new_tableaux and 0 remaining starting tableaux. % 0.80/0.98 # We now have 6 tableaux to operate on % 0.80/0.98 # Found closed tableau during pool population. % 0.80/0.98 # Proof search is over... % 0.80/0.98 # Freeing feature tree %------------------------------------------------------------------------------