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