%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT009-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 : n027.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:54 EDT 2022 % Result : Unsatisfiable 0.18s 0.42s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : CAT009-1 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n027.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun May 29 19:40:00 EDT 2022 % 0.13/0.34 % CPUTime : % 0.18/0.37 # No SInE strategy applied % 0.18/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S % 0.18/0.37 # and selection function SelectComplexG. % 0.18/0.37 # % 0.18/0.37 # Presaturation interreduction done % 0.18/0.37 # Number of axioms: 20 Number of unprocessed: 20 % 0.18/0.37 # Tableaux proof search. % 0.18/0.37 # APR header successfully linked. % 0.18/0.37 # Hello from C++ % 0.18/0.41 # The folding up rule is enabled... % 0.18/0.41 # Local unification is enabled... % 0.18/0.41 # Any saturation attempts will use folding labels... % 0.18/0.41 # 20 beginning clauses after preprocessing and clausification % 0.18/0.41 # Creating start rules for all 1 conjectures. % 0.18/0.41 # There are 1 start rule candidates: % 0.18/0.41 # Found 8 unit axioms. % 0.18/0.41 # 1 start rule tableaux created. % 0.18/0.41 # 12 extension rule candidate clauses % 0.18/0.41 # 8 unit axiom clauses % 0.18/0.41 % 0.18/0.41 # Requested 8, 32 cores available to the main process. % 0.18/0.41 # There are not enough tableaux to fork, creating more from the initial 1 % 0.18/0.42 # There were 2 total branch saturation attempts. % 0.18/0.42 # There were 0 of these attempts blocked. % 0.18/0.42 # There were 0 deferred branch saturation attempts. % 0.18/0.42 # There were 0 free duplicated saturations. % 0.18/0.42 # There were 2 total successful branch saturations. % 0.18/0.42 # There were 0 successful branch saturations in interreduction. % 0.18/0.42 # There were 0 successful branch saturations on the branch. % 0.18/0.42 # There were 2 successful branch saturations after the branch. % 0.18/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.42 # Begin clausification derivation % 0.18/0.42 % 0.18/0.42 # End clausification derivation % 0.18/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.42 cnf(i_0_39, hypothesis, (defined(b,a))). % 0.18/0.42 cnf(i_0_30, plain, (identity_map(domain(X1)))). % 0.18/0.42 cnf(i_0_31, plain, (identity_map(codomain(X1)))). % 0.18/0.42 cnf(i_0_32, plain, (defined(X1,domain(X1)))). % 0.18/0.42 cnf(i_0_33, plain, (defined(codomain(X1),X1))). % 0.18/0.42 cnf(i_0_34, plain, (product(X1,domain(X1),X1))). % 0.18/0.42 cnf(i_0_35, plain, (product(codomain(X1),X1,X1))). % 0.18/0.42 cnf(i_0_40, negated_conjecture, (domain(compose(b,a))!=domain(a))). % 0.18/0.42 cnf(i_0_22, plain, (defined(X1,X2)|~product(X1,X2,X3))). % 0.18/0.42 cnf(i_0_36, plain, (product(X1,X2,X2)|~identity_map(X1)|~defined(X1,X2))). % 0.18/0.42 cnf(i_0_37, plain, (product(X1,X2,X1)|~identity_map(X2)|~defined(X1,X2))). % 0.18/0.42 cnf(i_0_21, plain, (product(X1,X2,compose(X1,X2))|~defined(X1,X2))). % 0.18/0.42 cnf(i_0_38, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))). % 0.18/0.42 cnf(i_0_26, plain, (defined(X1,X2)|~product(X2,X3,X4)|~defined(X1,X4))). % 0.18/0.42 cnf(i_0_23, plain, (defined(X1,X2)|~product(X3,X1,X4)|~defined(X4,X2))). % 0.18/0.42 cnf(i_0_29, plain, (defined(X1,X2)|~identity_map(X3)|~defined(X3,X2)|~defined(X1,X3))). % 0.18/0.42 cnf(i_0_27, plain, (defined(X1,X2)|~product(X3,X4,X1)|~product(X4,X2,X5)|~defined(X3,X5))). % 0.18/0.42 cnf(i_0_24, plain, (defined(X1,X2)|~product(X3,X4,X2)|~product(X1,X3,X5)|~defined(X5,X4))). % 0.18/0.42 cnf(i_0_28, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X1)|~product(X6,X2,X5))). % 0.18/0.42 cnf(i_0_25, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))). % 0.18/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.42 # Begin printing tableau % 0.18/0.42 # Found 9 steps % 0.18/0.42 cnf(i_0_40, negated_conjecture, (domain(compose(b,a))!=domain(a)), inference(start_rule)). % 0.18/0.42 cnf(i_0_41, plain, (domain(compose(b,a))!=domain(a)), inference(extension_rule, [i_0_38])). % 0.18/0.42 cnf(i_0_53, plain, (~product(domain(a),domain(domain(a)),domain(a))), inference(closure_rule, [i_0_34])). % 0.18/0.42 cnf(i_0_54, plain, (~product(domain(a),domain(domain(a)),domain(compose(b,a)))), inference(extension_rule, [i_0_25])). % 0.18/0.42 cnf(i_0_117, plain, (~product(domain(compose(b,a)),domain(domain(compose(b,a))),domain(compose(b,a)))), inference(closure_rule, [i_0_34])). % 0.18/0.42 cnf(i_0_119, plain, (~product(domain(a),domain(compose(b,a)),domain(compose(b,a)))), inference(extension_rule, [i_0_36])). % 0.18/0.42 cnf(i_0_162, plain, (~identity_map(domain(a))), inference(closure_rule, [i_0_30])). % 0.18/0.42 cnf(i_0_118, plain, (~product(domain(compose(b,a)),domain(domain(compose(b,a))),domain(domain(a)))), inference(etableau_closure_rule, [i_0_118, ...])). % 0.18/0.42 cnf(i_0_163, plain, (~defined(domain(a),domain(compose(b,a)))), inference(etableau_closure_rule, [i_0_163, ...])). % 0.18/0.42 # End printing tableau % 0.18/0.42 # SZS output end % 0.18/0.42 # Branches closed with saturation will be marked with an "s" % 0.18/0.42 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.18/0.42 # We now have 4 tableaux to operate on % 0.18/0.42 # Found closed tableau during pool population. % 0.18/0.42 # Proof search is over... % 0.18/0.42 # Freeing feature tree %------------------------------------------------------------------------------