%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : COL075-1 : 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 : n021.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:48 EDT 2022 % Result : Unsatisfiable 0.19s 0.48s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : COL075-1 : TPTP v8.1.0. Released v1.2.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n021.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue May 31 12:16:29 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C02AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 11 Number of unprocessed: 11 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.47 # The folding up rule is enabled... % 0.19/0.47 # Local unification is enabled... % 0.19/0.47 # Any saturation attempts will use folding labels... % 0.19/0.47 # 11 beginning clauses after preprocessing and clausification % 0.19/0.47 # Creating start rules for all 1 conjectures. % 0.19/0.47 # There are 1 start rule candidates: % 0.19/0.47 # Found 9 unit axioms. % 0.19/0.47 # 1 start rule tableaux created. % 0.19/0.47 # 2 extension rule candidate clauses % 0.19/0.47 # 9 unit axiom clauses % 0.19/0.47 % 0.19/0.47 # Requested 8, 32 cores available to the main process. % 0.19/0.47 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.48 # There were 1 total branch saturation attempts. % 0.19/0.48 # There were 0 of these attempts blocked. % 0.19/0.48 # There were 0 deferred branch saturation attempts. % 0.19/0.48 # There were 0 free duplicated saturations. % 0.19/0.48 # There were 1 total successful branch saturations. % 0.19/0.48 # There were 0 successful branch saturations in interreduction. % 0.19/0.48 # There were 0 successful branch saturations on the branch. % 0.19/0.48 # There were 1 successful branch saturations after the branch. % 0.19/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.48 # Begin clausification derivation % 0.19/0.48 % 0.19/0.48 # End clausification derivation % 0.19/0.48 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.48 cnf(i_0_12, plain, (apply(apply(k,X1),X2)=X1)). % 0.19/0.48 cnf(i_0_18, plain, (apply(eq,pair(X1,X1))=projection1)). % 0.19/0.48 cnf(i_0_13, plain, (apply(projection1,pair(X1,X2))=X1)). % 0.19/0.48 cnf(i_0_14, plain, (apply(projection2,pair(X1,X2))=X2)). % 0.19/0.48 cnf(i_0_16, plain, (pair(apply(X1,X2),apply(X3,X2))=apply(pair(X1,X3),X2))). % 0.19/0.48 cnf(i_0_17, plain, (apply(apply(X1,apply(k,X2)),apply(X3,X2))=apply(apply(apply(abstraction,X1),X3),X2))). % 0.19/0.48 cnf(i_0_15, plain, (apply(pair(projection1,projection2),X1)=X1)). % 0.19/0.48 cnf(i_0_21, plain, (projection1!=projection2)). % 0.19/0.48 cnf(i_0_22, negated_conjecture, (apply(apply(X1,b(X1)),c(X1))!=apply(b(X1),b(X1)))). % 0.19/0.48 cnf(i_0_19, plain, (apply(eq,pair(X1,X2))=projection2|X1=X2)). % 0.19/0.48 cnf(i_0_20, plain, (X1=X2|apply(X1,n(X1,X2))!=apply(X2,n(X1,X2)))). % 0.19/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.48 # Begin printing tableau % 0.19/0.48 # Found 4 steps % 0.19/0.48 cnf(i_0_22, negated_conjecture, (apply(apply(X7,b(X7)),c(X7))!=apply(b(X7),b(X7))), inference(start_rule)). % 0.19/0.48 cnf(i_0_23, plain, (apply(apply(X7,b(X7)),c(X7))!=apply(b(X7),b(X7))), inference(extension_rule, [i_0_20])). % 0.19/0.48 cnf(i_0_27, plain, (apply(apply(apply(X7,b(X7)),c(X7)),n(apply(apply(X7,b(X7)),c(X7)),apply(b(X7),b(X7))))!=apply(apply(b(X7),b(X7)),n(apply(apply(X7,b(X7)),c(X7)),apply(b(X7),b(X7))))), inference(extension_rule, [i_0_19])). % 0.19/0.48 cnf(i_0_28, plain, (apply(eq,pair(apply(apply(apply(X7,b(X7)),c(X7)),n(apply(apply(X7,b(X7)),c(X7)),apply(b(X7),b(X7)))),apply(apply(b(X7),b(X7)),n(apply(apply(X7,b(X7)),c(X7)),apply(b(X7),b(X7))))))=projection2), inference(etableau_closure_rule, [i_0_28, ...])). % 0.19/0.48 # End printing tableau % 0.19/0.48 # SZS output end % 0.19/0.48 # Branches closed with saturation will be marked with an "s" % 0.19/0.48 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.19/0.48 # We now have 2 tableaux to operate on % 0.19/0.48 # Found closed tableau during pool population. % 0.19/0.48 # Proof search is over... % 0.19/0.48 # Freeing feature tree %------------------------------------------------------------------------------