%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT004-2 : 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 : n024.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:53 EDT 2022 % Result : Unsatisfiable 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : CAT004-2 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n024.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Sun May 29 15:29:21 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.12/0.37 # and selection function SelectCQIPrecWNTNp. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 14 Number of unprocessed: 14 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 14 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 1 conjectures. % 0.12/0.37 # There are 1 start rule candidates: % 0.12/0.37 # Found 9 unit axioms. % 0.12/0.37 # 1 start rule tableaux created. % 0.12/0.37 # 5 extension rule candidate clauses % 0.12/0.37 # 9 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.41 # There were 5 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 5 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 5 successful branch saturations after the branch. % 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_24, hypothesis, (codomain(a)=domain(b))). % 0.20/0.41 cnf(i_0_16, plain, (domain(codomain(X1))=codomain(X1))). % 0.20/0.41 cnf(i_0_15, plain, (codomain(domain(X1))=domain(X1))). % 0.20/0.41 cnf(i_0_18, plain, (compose(X1,codomain(X1))=X1)). % 0.20/0.41 cnf(i_0_17, plain, (compose(domain(X1),X1)=X1)). % 0.20/0.41 cnf(i_0_25, hypothesis, (codomain(compose(a,b))=domain(h))). % 0.20/0.41 cnf(i_0_26, hypothesis, (domain(g)=domain(h))). % 0.20/0.41 cnf(i_0_27, hypothesis, (compose(compose(a,b),g)=compose(compose(a,b),h))). % 0.20/0.41 cnf(i_0_28, negated_conjecture, (g!=h)). % 0.20/0.41 cnf(i_0_19, plain, (domain(compose(X1,X2))=domain(X1)|codomain(X1)!=domain(X2))). % 0.20/0.41 cnf(i_0_20, plain, (codomain(compose(X1,X2))=codomain(X2)|codomain(X1)!=domain(X2))). % 0.20/0.41 cnf(i_0_21, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3))|codomain(X2)!=domain(X3)|codomain(X1)!=domain(X2))). % 0.20/0.41 cnf(i_0_22, hypothesis, (X1=X2|compose(a,X1)!=compose(a,X2)|domain(b)!=domain(X2)|domain(b)!=domain(X1))). % 0.20/0.41 cnf(i_0_23, hypothesis, (X1=X2|compose(b,X1)!=compose(b,X2)|codomain(b)!=domain(X2)|codomain(b)!=domain(X1))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 8 steps % 0.20/0.41 cnf(i_0_28, negated_conjecture, (g!=h), inference(start_rule)). % 0.20/0.41 cnf(i_0_31, plain, (g!=h), inference(extension_rule, [i_0_23])). % 0.20/0.41 cnf(i_0_44, plain, (compose(b,g)!=compose(b,h)), inference(extension_rule, [i_0_22])). % 0.20/0.41 cnf(i_0_45, plain, (codomain(b)!=domain(h)), inference(etableau_closure_rule, [i_0_45, ...])). % 0.20/0.41 cnf(i_0_46, plain, (codomain(b)!=domain(g)), inference(etableau_closure_rule, [i_0_46, ...])). % 0.20/0.41 cnf(i_0_55, plain, (compose(a,compose(b,g))!=compose(a,compose(b,h))), inference(etableau_closure_rule, [i_0_55, ...])). % 0.20/0.41 cnf(i_0_56, plain, (domain(compose(b,h))!=domain(b)), inference(etableau_closure_rule, [i_0_56, ...])). % 0.20/0.41 cnf(i_0_57, plain, (domain(compose(b,g))!=domain(b)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.20/0.41 # We now have 2 tableaux to operate on % 0.20/0.41 # Found closed tableau during pool population. % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------