%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT013-4 : 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 : n019.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:56 EDT 2022 % Result : Unsatisfiable 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : CAT013-4 : TPTP v8.1.0. Released v1.0.0. % 0.08/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 : n019.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 : Sun May 29 19:50:26 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.14/0.38 # and selection function SelectCQArEqLast. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 13 Number of unprocessed: 13 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 13 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 5 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 8 extension rule candidate clauses % 0.14/0.39 # 5 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # There were 1 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 1 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 1 successful branch saturations after the branch. % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_25, hypothesis, (there_exists(codomain(a)))). % 0.14/0.39 cnf(i_0_23, plain, (compose(X1,domain(X1))=X1)). % 0.14/0.39 cnf(i_0_24, plain, (compose(codomain(X1),X1)=X1)). % 0.14/0.39 cnf(i_0_22, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3)))). % 0.14/0.39 cnf(i_0_26, negated_conjecture, (domain(codomain(a))!=codomain(a))). % 0.14/0.39 cnf(i_0_15, plain, (X1=X2|~equivalent(X1,X2))). % 0.14/0.39 cnf(i_0_17, plain, (there_exists(X1)|~there_exists(domain(X1)))). % 0.14/0.39 cnf(i_0_18, plain, (there_exists(X1)|~there_exists(codomain(X1)))). % 0.14/0.39 cnf(i_0_14, plain, (there_exists(X1)|~equivalent(X1,X2))). % 0.14/0.39 cnf(i_0_20, plain, (codomain(X1)=domain(X2)|~there_exists(compose(X2,X1)))). % 0.14/0.39 cnf(i_0_19, plain, (there_exists(domain(X1))|~there_exists(compose(X1,X2)))). % 0.14/0.39 cnf(i_0_21, plain, (there_exists(compose(X1,X2))|codomain(X2)!=domain(X1)|~there_exists(domain(X1)))). % 0.14/0.39 cnf(i_0_16, plain, (equivalent(X1,X1)|~there_exists(X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 4 steps % 0.14/0.39 cnf(i_0_26, negated_conjecture, (domain(codomain(a))!=codomain(a)), inference(start_rule)). % 0.14/0.39 cnf(i_0_28, plain, (domain(codomain(a))!=codomain(a)), inference(extension_rule, [i_0_20])). % 0.14/0.39 cnf(i_0_38, plain, (~there_exists(compose(codomain(a),a))), inference(extension_rule, [i_0_17])). % 0.14/0.39 cnf(i_0_49, plain, (~there_exists(domain(compose(codomain(a),a)))), inference(etableau_closure_rule, [i_0_49, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 2 tableaux to operate on % 0.14/0.39 # Found closed tableau during pool population. % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------