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