%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CAT020-2 : 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 : 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:58 EDT 2022 % Result : Satisfiable 0.21s 0.39s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : CAT020-2 : TPTP v8.1.0. Released v2.5.0. % 0.07/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.35 % Computer : n024.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sun May 29 19:20:36 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.14/0.38 # and selection function SelectCQIPrecWNTNp. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 7 Number of unprocessed: 7 % 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.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 7 beginning clauses after preprocessing and clausification % 0.14/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.14/0.38 # No conjectures. % 0.14/0.38 # There are 7 start rule candidates: % 0.14/0.38 # Found 4 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 7 start rule tableaux created. % 0.14/0.38 # 3 extension rule candidate clauses % 0.14/0.38 # 4 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 7 % 0.14/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.14/0.38 # We now have 13 tableaux to operate on % 0.21/0.39 # Creating equality axioms % 0.21/0.39 # Ran out of tableaux, making start rules for all clauses % 0.21/0.39 # 21001 Satisfiable branch % 0.21/0.39 # Satisfiable branch found. % 0.21/0.39 # There were 1 total branch saturation attempts. % 0.21/0.39 # There were 0 of these attempts blocked. % 0.21/0.39 # There were 0 deferred branch saturation attempts. % 0.21/0.39 # There were 0 free duplicated saturations. % 0.21/0.39 # There were 0 total successful branch saturations. % 0.21/0.39 # There were 0 successful branch saturations in interreduction. % 0.21/0.39 # There were 0 successful branch saturations on the branch. % 0.21/0.39 # There were 0 successful branch saturations after the branch. % 0.21/0.39 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.21/0.39 # Begin clausification derivation % 0.21/0.39 % 0.21/0.39 # End clausification derivation % 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.39 cnf(i_0_9, plain, (domain(codomain(X1))=codomain(X1))). % 0.21/0.39 cnf(i_0_8, plain, (codomain(domain(X1))=domain(X1))). % 0.21/0.39 cnf(i_0_11, plain, (compose(X1,codomain(X1))=X1)). % 0.21/0.39 cnf(i_0_10, plain, (compose(domain(X1),X1)=X1)). % 0.21/0.39 cnf(i_0_12, plain, (domain(compose(X1,X2))=domain(X1)|codomain(X1)!=domain(X2))). % 0.21/0.39 cnf(i_0_13, plain, (codomain(compose(X1,X2))=codomain(X2)|codomain(X1)!=domain(X2))). % 0.21/0.39 cnf(i_0_14, plain, (compose(compose(X1,X2),X3)=compose(X1,compose(X2,X3))|codomain(X2)!=domain(X3)|codomain(X1)!=domain(X2))). % 0.21/0.39 cnf(i_0_47, plain, (X4=X4)). % 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.39 # Begin printing tableau % 0.21/0.39 # Found 4 steps % 0.21/0.39 cnf(i_0_47, plain, (codomain(X1)=codomain(X1)), inference(start_rule)). % 0.21/0.39 cnf(i_0_65, plain, (codomain(X1)=codomain(X1)), inference(extension_rule, [i_0_51])). % 0.21/0.39 cnf(i_0_80, plain, (domain(codomain(X1))=domain(codomain(X1))), inference(extension_rule, [i_0_50])). % 0.21/0.39 cnf(i_0_95, plain, (domain(codomain(X1))!=codomain(X1)), inference(closure_rule, [i_0_9])). % 0.21/0.39 # End printing tableau % 0.21/0.39 # SZS output end % 0.21/0.39 # Branches closed with saturation will be marked with an "s" % 0.21/0.39 # Creating equality axioms % 0.21/0.39 # Ran out of tableaux, making start rules for all clauses % 0.21/0.39 # 20994 Satisfiable branch % 0.21/0.39 # Child (21001) has found a proof. % 0.21/0.39 % 0.21/0.39 # Creating equality axioms % 0.21/0.39 # Ran out of tableaux, making start rules for all clauses % 0.21/0.39 # 20995 Satisfiable branch % 0.21/0.39 # Proof search is over... % 0.21/0.39 # Freeing feature tree %------------------------------------------------------------------------------