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