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