%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL044-4 : TPTP v8.1.0. Released v1.2.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 : Fri Jul 15 00:24:41 EDT 2022 % Result : Unsatisfiable 1.39s 0.58s % Output : CNFRefutation 1.39s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : COL044-4 : TPTP v8.1.0. Released v1.2.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue May 31 14:29:36 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 4 Number of unprocessed: 4 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 4 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 1 conjectures. % 0.12/0.36 # There are 1 start rule candidates: % 0.12/0.36 # Found 3 unit axioms. % 0.12/0.36 # 1 start rule tableaux created. % 0.12/0.36 # 1 extension rule candidate clauses % 0.12/0.36 # 3 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.36 # Creating equality axioms % 0.12/0.36 # Ran out of tableaux, making start rules for all clauses % 0.12/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 9 tableaux to operate on % 1.39/0.58 # There were 1 total branch saturation attempts. % 1.39/0.58 # There were 0 of these attempts blocked. % 1.39/0.58 # There were 0 deferred branch saturation attempts. % 1.39/0.58 # There were 0 free duplicated saturations. % 1.39/0.58 # There were 1 total successful branch saturations. % 1.39/0.58 # There were 0 successful branch saturations in interreduction. % 1.39/0.58 # There were 0 successful branch saturations on the branch. % 1.39/0.58 # There were 1 successful branch saturations after the branch. % 1.39/0.58 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.39/0.58 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.39/0.58 # Begin clausification derivation % 1.39/0.58 % 1.39/0.58 # End clausification derivation % 1.39/0.58 # Begin listing active clauses obtained from FOF to CNF conversion % 1.39/0.58 cnf(i_0_5, plain, (apply(apply(apply(b,X1),X2),X3)=apply(X1,apply(X2,X3)))). % 1.39/0.58 cnf(i_0_6, plain, (apply(apply(apply(n,X1),X2),X3)=apply(apply(apply(X1,X3),X2),X3))). % 1.39/0.58 cnf(i_0_8, negated_conjecture, (~fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b)))). % 1.39/0.58 cnf(i_0_7, plain, (fixed_point(X1)|apply(fixed_pt,apply(X1,fixed_pt))!=apply(X1,fixed_pt))). % 1.39/0.58 cnf(i_0_14, plain, (X4=X4)). % 1.39/0.58 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.39/0.58 # Begin printing tableau % 1.39/0.58 # Found 7 steps % 1.39/0.58 cnf(i_0_5, plain, (apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),fixed_pt)=apply(apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b),apply(b,fixed_pt))), inference(start_rule)). % 1.39/0.58 cnf(i_0_20, plain, (apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),fixed_pt)=apply(apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b),apply(b,fixed_pt))), inference(extension_rule, [i_0_17])). % 1.39/0.58 cnf(i_0_34, plain, (apply(apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b),apply(b,fixed_pt))!=apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n),apply(b,apply(b,fixed_pt)))), inference(closure_rule, [i_0_5])). % 1.39/0.58 cnf(i_0_32, plain, (apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),fixed_pt)=apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n),apply(b,apply(b,fixed_pt)))), inference(extension_rule, [i_0_17])). % 1.39/0.58 cnf(i_0_47, plain, (apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),fixed_pt)=apply(fixed_pt,apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),fixed_pt))), inference(extension_rule, [i_0_7])). % 1.39/0.58 cnf(i_0_50, plain, (fixed_point(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b))), inference(closure_rule, [i_0_8])). % 1.39/0.58 cnf(i_0_49, plain, (apply(fixed_pt,apply(apply(apply(b,apply(apply(b,apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n)),b)),b),fixed_pt))!=apply(apply(apply(n,apply(n,apply(apply(b,apply(b,b)),apply(n,apply(apply(b,b),n))))),n),apply(b,apply(b,fixed_pt)))), inference(etableau_closure_rule, [i_0_49, ...])). % 1.39/0.58 # End printing tableau % 1.39/0.58 # SZS output end % 1.39/0.58 # Branches closed with saturation will be marked with an "s" % 1.39/0.58 # Child (16014) has found a proof. % 1.39/0.58 % 1.39/0.58 # Proof search is over... % 1.39/0.58 # Freeing feature tree %------------------------------------------------------------------------------