%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT020-1 : TPTP v8.1.0. Released v2.5.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 : n032.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:58 EDT 2022 % Result : Satisfiable 0.13s 0.33s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.09 % Problem : CAT020-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.29 % Computer : n032.cluster.edu % 0.08/0.29 % Model : x86_64 x86_64 % 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.29 % Memory : 8042.1875MB % 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.29 % CPULimit : 300 % 0.08/0.29 % WCLimit : 600 % 0.08/0.29 % DateTime : Sun May 29 17:13:11 EDT 2022 % 0.08/0.29 % CPUTime : % 0.13/0.32 # No SInE strategy applied % 0.13/0.32 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.13/0.32 # and selection function SelectComplexG. % 0.13/0.32 # % 0.13/0.32 # Presaturation interreduction done % 0.13/0.32 # Number of axioms: 18 Number of unprocessed: 18 % 0.13/0.32 # Tableaux proof search. % 0.13/0.32 # APR header successfully linked. % 0.13/0.32 # Hello from C++ % 0.13/0.32 # The folding up rule is enabled... % 0.13/0.32 # Local unification is enabled... % 0.13/0.32 # Any saturation attempts will use folding labels... % 0.13/0.32 # 18 beginning clauses after preprocessing and clausification % 0.13/0.32 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.32 # No conjectures. % 0.13/0.32 # There are 18 start rule candidates: % 0.13/0.32 # Found 6 unit axioms. % 0.13/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.32 # 18 start rule tableaux created. % 0.13/0.32 # 12 extension rule candidate clauses % 0.13/0.32 # 6 unit axiom clauses % 0.13/0.32 % 0.13/0.32 # Requested 8, 32 cores available to the main process. % 0.13/0.33 # 3829 Satisfiable branch % 0.13/0.33 # Satisfiable branch found. % 0.13/0.33 # There were 1 total branch saturation attempts. % 0.13/0.33 # There were 0 of these attempts blocked. % 0.13/0.33 # There were 0 deferred branch saturation attempts. % 0.13/0.33 # There were 0 free duplicated saturations. % 0.13/0.33 # There were 0 total successful branch saturations. % 0.13/0.33 # There were 0 successful branch saturations in interreduction. % 0.13/0.33 # There were 0 successful branch saturations on the branch. % 0.13/0.33 # There were 0 successful branch saturations after the branch. % 0.13/0.33 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.33 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.33 # Begin clausification derivation % 0.13/0.33 % 0.13/0.33 # End clausification derivation % 0.13/0.33 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.33 cnf(i_0_28, plain, (identity_map(domain(X1)))). % 0.13/0.33 cnf(i_0_29, plain, (identity_map(codomain(X1)))). % 0.13/0.33 cnf(i_0_30, plain, (defined(X1,domain(X1)))). % 0.13/0.33 cnf(i_0_31, plain, (defined(codomain(X1),X1))). % 0.13/0.33 cnf(i_0_32, plain, (product(X1,domain(X1),X1))). % 0.13/0.33 cnf(i_0_33, plain, (product(codomain(X1),X1,X1))). % 0.13/0.33 cnf(i_0_20, plain, (defined(X1,X2)|~product(X1,X2,X3))). % 0.13/0.33 cnf(i_0_34, plain, (product(X1,X2,X2)|~identity_map(X1)|~defined(X1,X2))). % 0.13/0.33 cnf(i_0_35, plain, (product(X1,X2,X1)|~identity_map(X2)|~defined(X1,X2))). % 0.13/0.33 cnf(i_0_24, plain, (defined(X1,X2)|~product(X2,X3,X4)|~defined(X1,X4))). % 0.13/0.33 cnf(i_0_21, plain, (defined(X1,X2)|~product(X3,X1,X4)|~defined(X4,X2))). % 0.13/0.33 cnf(i_0_19, plain, (product(X1,X2,compose(X1,X2))|~defined(X1,X2))). % 0.13/0.33 cnf(i_0_36, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.13/0.33 cnf(i_0_27, plain, (defined(X1,X2)|~identity_map(X3)|~defined(X3,X2)|~defined(X1,X3))). % 0.13/0.33 cnf(i_0_25, plain, (defined(X1,X2)|~product(X3,X4,X1)|~product(X4,X2,X5)|~defined(X3,X5))). % 0.13/0.33 cnf(i_0_22, plain, (defined(X1,X2)|~product(X3,X4,X2)|~product(X1,X3,X5)|~defined(X5,X4))). % 0.13/0.33 cnf(i_0_26, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X1)|~product(X6,X2,X5))). % 0.13/0.33 cnf(i_0_23, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.13/0.33 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.33 # Begin printing tableau % 0.13/0.33 # Found 4 steps % 0.13/0.33 cnf(i_0_32, plain, (product(domain(X1),domain(domain(X1)),domain(X1))), inference(start_rule)). % 0.13/0.33 cnf(i_0_41, plain, (product(domain(X1),domain(domain(X1)),domain(X1))), inference(extension_rule, [i_0_20])). % 0.13/0.33 cnf(i_0_82, plain, (defined(domain(X1),domain(domain(X1)))), inference(extension_rule, [i_0_34])). % 0.13/0.33 cnf(i_0_85, plain, (~identity_map(domain(X1))), inference(closure_rule, [i_0_28])). % 0.13/0.33 # End printing tableau % 0.13/0.33 # SZS output end % 0.13/0.33 # Branches closed with saturation will be marked with an "s" % 0.13/0.33 # Child (3829) has found a proof. % 0.13/0.33 % 0.13/0.33 # Proof search is over... % 0.13/0.33 # Freeing feature tree %------------------------------------------------------------------------------