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