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